TSTP Solution File: GEO474+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO474+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:35:05 EDT 2023
% Result : Theorem 1052.81s 130.27s
% Output : CNFRefutation 1052.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 9 unt; 0 def)
% Number of atoms : 19 ( 18 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 14 ( 8 ~; 4 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn; 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aRANKu_0,conjecture,
! [X1464,X1465] : s(num,i(s(fun(cart(cart(real,X1464),X1465),num),rank),s(cart(cart(real,X1464),X1465),i(s(fun(num,cart(cart(real,X1464),X1465)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))) = s(num,i(s(fun(num,num),numeral),s(num,u_0))),
file('/export/starexec/sandbox/tmp/tmp.S894qem2KS/E---3.1_19174.p',aRANKu_0) ).
fof(aNUMERAL,axiom,
! [X84] : s(num,i(s(fun(num,num),numeral),s(num,X84))) = s(num,X84),
file('/export/starexec/sandbox/tmp/tmp.S894qem2KS/E---3.1_19174.p',aNUMERAL) ).
fof(aRANKu_EQu_0,axiom,
! [X738,X733,X16] :
( s(num,i(s(fun(cart(cart(real,X738),X733),num),rank),s(cart(cart(real,X738),X733),X16))) = s(num,i(s(fun(num,num),numeral),s(num,u_0)))
<=> s(cart(cart(real,X738),X733),X16) = s(cart(cart(real,X738),X733),i(s(fun(num,cart(cart(real,X738),X733)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) ),
file('/export/starexec/sandbox/tmp/tmp.S894qem2KS/E---3.1_19174.p',aRANKu_EQu_0) ).
fof(c_0_3,negated_conjecture,
~ ! [X1464,X1465] : s(num,i(s(fun(cart(cart(real,X1464),X1465),num),rank),s(cart(cart(real,X1464),X1465),i(s(fun(num,cart(cart(real,X1464),X1465)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))) = s(num,i(s(fun(num,num),numeral),s(num,u_0))),
inference(assume_negation,[status(cth)],[aRANKu_0]) ).
fof(c_0_4,negated_conjecture,
s(num,i(s(fun(cart(cart(real,esk1_0),esk2_0),num),rank),s(cart(cart(real,esk1_0),esk2_0),i(s(fun(num,cart(cart(real,esk1_0),esk2_0)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))) != s(num,i(s(fun(num,num),numeral),s(num,u_0))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X1565] : s(num,i(s(fun(num,num),numeral),s(num,X1565))) = s(num,X1565),
inference(variable_rename,[status(thm)],[aNUMERAL]) ).
fof(c_0_6,plain,
! [X1693,X1694,X1695] :
( ( s(num,i(s(fun(cart(cart(real,X1693),X1694),num),rank),s(cart(cart(real,X1693),X1694),X1695))) != s(num,i(s(fun(num,num),numeral),s(num,u_0)))
| s(cart(cart(real,X1693),X1694),X1695) = s(cart(cart(real,X1693),X1694),i(s(fun(num,cart(cart(real,X1693),X1694)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) )
& ( s(cart(cart(real,X1693),X1694),X1695) != s(cart(cart(real,X1693),X1694),i(s(fun(num,cart(cart(real,X1693),X1694)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0)))))
| s(num,i(s(fun(cart(cart(real,X1693),X1694),num),rank),s(cart(cart(real,X1693),X1694),X1695))) = s(num,i(s(fun(num,num),numeral),s(num,u_0))) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[aRANKu_EQu_0])]) ).
cnf(c_0_7,negated_conjecture,
s(num,i(s(fun(cart(cart(real,esk1_0),esk2_0),num),rank),s(cart(cart(real,esk1_0),esk2_0),i(s(fun(num,cart(cart(real,esk1_0),esk2_0)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))) != s(num,i(s(fun(num,num),numeral),s(num,u_0))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( s(num,i(s(fun(cart(cart(real,X1),X2),num),rank),s(cart(cart(real,X1),X2),X3))) = s(num,i(s(fun(num,num),numeral),s(num,u_0)))
| s(cart(cart(real,X1),X2),X3) != s(cart(cart(real,X1),X2),i(s(fun(num,cart(cart(real,X1),X2)),mat),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
s(num,i(s(fun(cart(cart(real,esk1_0),esk2_0),num),rank),s(cart(cart(real,esk1_0),esk2_0),i(s(fun(num,cart(cart(real,esk1_0),esk2_0)),mat),s(num,u_0))))) != s(num,u_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_11,plain,
( s(num,i(s(fun(cart(cart(real,X1),X2),num),rank),s(cart(cart(real,X1),X2),X3))) = s(num,u_0)
| s(cart(cart(real,X1),X2),X3) != s(cart(cart(real,X1),X2),i(s(fun(num,cart(cart(real,X1),X2)),mat),s(num,u_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8]),c_0_8]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_10,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : GEO474+1 : TPTP v8.1.2. Released v7.0.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n001.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 07:22:07 EDT 2023
% 0.12/0.33 % CPUTime :
% 1.24/1.39 Running first-order model finding
% 1.24/1.39 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.S894qem2KS/E---3.1_19174.p
% 1052.81/130.27 # Version: 3.1pre001
% 1052.81/130.27 # Preprocessing class: FMLMSMSLSSSNFFN.
% 1052.81/130.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1052.81/130.27 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 1052.81/130.27 # Starting new_bool_3 with 600s (2) cores
% 1052.81/130.27 # Starting new_bool_1 with 600s (2) cores
% 1052.81/130.27 # Starting sh5l with 300s (1) cores
% 1052.81/130.27 # new_bool_3 with pid 19252 completed with status 0
% 1052.81/130.27 # Result found by new_bool_3
% 1052.81/130.27 # Preprocessing class: FMLMSMSLSSSNFFN.
% 1052.81/130.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1052.81/130.27 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 1052.81/130.27 # Starting new_bool_3 with 600s (2) cores
% 1052.81/130.27 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1052.81/130.27 # Search class: FGHSM-SMLM33-DFFFFFNN
% 1052.81/130.27 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 1052.81/130.27 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 1052.81/130.27 # Starting new_bool_3 with 61s (1) cores
% 1052.81/130.27 # new_bool_3 with pid 19256 completed with status 7
% 1052.81/130.27 # Starting SAT001_CA_MinMin_p005000_rr with 55s (1) cores
% 1052.81/130.27 # SAT001_CA_MinMin_p005000_rr with pid 19314 completed with status 7
% 1052.81/130.27 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 55s (1) cores
% 1052.81/130.27 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 19319 completed with status 0
% 1052.81/130.27 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 1052.81/130.27 # Preprocessing class: FMLMSMSLSSSNFFN.
% 1052.81/130.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1052.81/130.27 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 1052.81/130.27 # Starting new_bool_3 with 600s (2) cores
% 1052.81/130.27 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1052.81/130.27 # Search class: FGHSM-SMLM33-DFFFFFNN
% 1052.81/130.27 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 1052.81/130.27 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 1052.81/130.27 # Starting new_bool_3 with 61s (1) cores
% 1052.81/130.27 # new_bool_3 with pid 19256 completed with status 7
% 1052.81/130.27 # Starting SAT001_CA_MinMin_p005000_rr with 55s (1) cores
% 1052.81/130.27 # SAT001_CA_MinMin_p005000_rr with pid 19314 completed with status 7
% 1052.81/130.27 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 55s (1) cores
% 1052.81/130.27 # Preprocessing time : 0.317 s
% 1052.81/130.27 # Presaturation interreduction done
% 1052.81/130.27
% 1052.81/130.27 # Proof found!
% 1052.81/130.27 # SZS status Theorem
% 1052.81/130.27 # SZS output start CNFRefutation
% See solution above
% 1052.81/130.27 # Parsed axioms : 3503
% 1052.81/130.27 # Removed by relevancy pruning/SinE : 2116
% 1052.81/130.27 # Initial clauses : 3565
% 1052.81/130.27 # Removed in clause preprocessing : 174
% 1052.81/130.27 # Initial clauses in saturation : 3391
% 1052.81/130.27 # Processed clauses : 9015
% 1052.81/130.27 # ...of these trivial : 135
% 1052.81/130.27 # ...subsumed : 5102
% 1052.81/130.27 # ...remaining for further processing : 3778
% 1052.81/130.27 # Other redundant clauses eliminated : 0
% 1052.81/130.27 # Clauses deleted for lack of memory : 0
% 1052.81/130.27 # Backward-subsumed : 31
% 1052.81/130.27 # Backward-rewritten : 132
% 1052.81/130.27 # Generated clauses : 192657
% 1052.81/130.27 # ...of the previous two non-redundant : 137820
% 1052.81/130.27 # ...aggressively subsumed : 0
% 1052.81/130.27 # Contextual simplify-reflections : 200
% 1052.81/130.27 # Paramodulations : 192631
% 1052.81/130.27 # Factorizations : 0
% 1052.81/130.27 # NegExts : 0
% 1052.81/130.27 # Equation resolutions : 26
% 1052.81/130.27 # Total rewrite steps : 104382
% 1052.81/130.27 # Propositional unsat checks : 0
% 1052.81/130.27 # Propositional check models : 0
% 1052.81/130.27 # Propositional check unsatisfiable : 0
% 1052.81/130.27 # Propositional clauses : 0
% 1052.81/130.27 # Propositional clauses after purity: 0
% 1052.81/130.27 # Propositional unsat core size : 0
% 1052.81/130.27 # Propositional preprocessing time : 0.000
% 1052.81/130.27 # Propositional encoding time : 0.000
% 1052.81/130.27 # Propositional solver time : 0.000
% 1052.81/130.27 # Success case prop preproc time : 0.000
% 1052.81/130.27 # Success case prop encoding time : 0.000
% 1052.81/130.27 # Success case prop solver time : 0.000
% 1052.81/130.27 # Current number of processed clauses : 783
% 1052.81/130.27 # Positive orientable unit clauses : 330
% 1052.81/130.27 # Positive unorientable unit clauses: 100
% 1052.81/130.27 # Negative unit clauses : 64
% 1052.81/130.27 # Non-unit-clauses : 289
% 1052.81/130.27 # Current number of unprocessed clauses: 134734
% 1052.81/130.27 # ...number of literals in the above : 263374
% 1052.81/130.27 # Current number of archived formulas : 0
% 1052.81/130.27 # Current number of archived clauses : 2995
% 1052.81/130.27 # Clause-clause subsumption calls (NU) : 3269831
% 1052.81/130.27 # Rec. Clause-clause subsumption calls : 290159
% 1052.81/130.27 # Non-unit clause-clause subsumptions : 2833
% 1052.81/130.27 # Unit Clause-clause subsumption calls : 2824
% 1052.81/130.27 # Rewrite failures with RHS unbound : 489
% 1052.81/130.27 # BW rewrite match attempts : 191612
% 1052.81/130.27 # BW rewrite match successes : 2570
% 1052.81/130.27 # Condensation attempts : 0
% 1052.81/130.27 # Condensation successes : 0
% 1052.81/130.27 # Termbank termtop insertions : 23368237
% 1052.81/130.27
% 1052.81/130.27 # -------------------------------------------------
% 1052.81/130.27 # User time : 126.272 s
% 1052.81/130.27 # System time : 1.349 s
% 1052.81/130.27 # Total time : 127.622 s
% 1052.81/130.27 # Maximum resident set size: 28676 pages
% 1052.81/130.27
% 1052.81/130.27 # -------------------------------------------------
% 1052.81/130.27 # User time : 252.160 s
% 1052.81/130.27 # System time : 3.105 s
% 1052.81/130.27 # Total time : 255.265 s
% 1052.81/130.27 # Maximum resident set size: 12540 pages
% 1052.81/130.27 % E---3.1 exiting
%------------------------------------------------------------------------------