TSTP Solution File: NUM853+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM853+2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 18:57:47 EDT 2023
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 14 unt; 0 def)
% Number of atoms : 64 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 57 ( 30 ~; 24 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn; 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(goal(130), 0), 2)',axiom,
! [X34,X35] :
( ~ greater(X34,X35)
| ~ less(X34,X35) ),
file('/export/starexec/sandbox2/tmp/tmp.8eDQ6YAxNA/E---3.1_12298.p','ass(cond(goal(130), 0), 2)') ).
fof('ass(cond(140, 0), 0)',axiom,
! [X32,X33] :
( greater(X32,X33)
=> less(X33,X32) ),
file('/export/starexec/sandbox2/tmp/tmp.8eDQ6YAxNA/E---3.1_12298.p','ass(cond(140, 0), 0)') ).
fof('ass(cond(270, 0), 0)',axiom,
! [X14,X15] : vmul(X14,X15) = vmul(X15,X14),
file('/export/starexec/sandbox2/tmp/tmp.8eDQ6YAxNA/E---3.1_12298.p','ass(cond(270, 0), 0)') ).
fof('holds(antec(307), 489, 0)',axiom,
greater(vmul(vd486,vd487),vmul(vd488,vd487)),
file('/export/starexec/sandbox2/tmp/tmp.8eDQ6YAxNA/E---3.1_12298.p','holds(antec(307), 489, 0)') ).
fof('ass(cond(299, 0), 2)',axiom,
! [X1,X6,X7] :
( greater(X6,X7)
=> greater(vmul(X6,X1),vmul(X7,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.8eDQ6YAxNA/E---3.1_12298.p','ass(cond(299, 0), 2)') ).
fof('ass(cond(147, 0), 0)',axiom,
! [X30,X31] :
( less(X30,X31)
=> greater(X31,X30) ),
file('/export/starexec/sandbox2/tmp/tmp.8eDQ6YAxNA/E---3.1_12298.p','ass(cond(147, 0), 0)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X34,X35] :
( X34 = X35
| greater(X34,X35)
| less(X34,X35) ),
file('/export/starexec/sandbox2/tmp/tmp.8eDQ6YAxNA/E---3.1_12298.p','ass(cond(goal(130), 0), 0)') ).
fof('ass(cond(goal(130), 0), 3)',axiom,
! [X34,X35] :
( X34 != X35
| ~ greater(X34,X35) ),
file('/export/starexec/sandbox2/tmp/tmp.8eDQ6YAxNA/E---3.1_12298.p','ass(cond(goal(130), 0), 3)') ).
fof('holds(conseq(307), 490, 0)',conjecture,
greater(vd486,vd488),
file('/export/starexec/sandbox2/tmp/tmp.8eDQ6YAxNA/E---3.1_12298.p','holds(conseq(307), 490, 0)') ).
fof(c_0_9,plain,
! [X34,X35] :
( ~ greater(X34,X35)
| ~ less(X34,X35) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 2)']) ).
fof(c_0_10,plain,
! [X104,X105] :
( ~ greater(X104,X105)
| ~ less(X104,X105) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_11,plain,
! [X98,X99] :
( ~ greater(X98,X99)
| less(X99,X98) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])]) ).
fof(c_0_12,plain,
! [X80,X81] : vmul(X80,X81) = vmul(X81,X80),
inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).
cnf(c_0_13,plain,
( ~ greater(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( less(X2,X1)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
greater(vmul(vd486,vd487),vmul(vd488,vd487)),
inference(split_conjunct,[status(thm)],['holds(antec(307), 489, 0)']) ).
cnf(c_0_16,plain,
vmul(X1,X2) = vmul(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X71,X72,X73] :
( ~ greater(X72,X73)
| greater(vmul(X72,X71),vmul(X73,X71)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(299, 0), 2)'])]) ).
cnf(c_0_18,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
greater(vmul(vd486,vd487),vmul(vd487,vd488)),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( greater(vmul(X1,X3),vmul(X2,X3))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X96,X97] :
( ~ less(X96,X97)
| greater(X97,X96) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(147, 0), 0)'])]) ).
fof(c_0_22,plain,
! [X100,X101] :
( X100 = X101
| greater(X100,X101)
| less(X100,X101) ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
fof(c_0_23,plain,
! [X34,X35] :
( X34 != X35
| ~ greater(X34,X35) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 3)']) ).
cnf(c_0_24,plain,
~ greater(vmul(vd487,vd488),vmul(vd486,vd487)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( greater(vmul(X1,X2),vmul(X3,X1))
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_26,plain,
( greater(X2,X1)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,negated_conjecture,
~ greater(vd486,vd488),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conseq(307), 490, 0)'])]) ).
fof(c_0_29,plain,
! [X106,X107] :
( X106 != X107
| ~ greater(X106,X107) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
~ greater(vd488,vd486),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( X1 = X2
| greater(X1,X2)
| greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
~ greater(vd486,vd488),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
( X1 != X2
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
vd488 = vd486,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_34]),c_0_16]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM853+2 : TPTP v8.1.2. Released v4.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n021.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 14:51:29 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.8eDQ6YAxNA/E---3.1_12298.p
% 0.17/0.47 # Version: 3.1pre001
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12376 completed with status 0
% 0.17/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # No SInE strategy applied
% 0.17/0.47 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 811s (1) cores
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.47 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.17/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12383 completed with status 0
% 0.17/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47 # No SInE strategy applied
% 0.17/0.47 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 811s (1) cores
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.47 # Preprocessing time : 0.001 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Theorem
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 37
% 0.17/0.47 # Removed by relevancy pruning/SinE : 0
% 0.17/0.47 # Initial clauses : 41
% 0.17/0.47 # Removed in clause preprocessing : 2
% 0.17/0.47 # Initial clauses in saturation : 39
% 0.17/0.47 # Processed clauses : 419
% 0.17/0.47 # ...of these trivial : 19
% 0.17/0.47 # ...subsumed : 223
% 0.17/0.47 # ...remaining for further processing : 176
% 0.17/0.47 # Other redundant clauses eliminated : 41
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 4
% 0.17/0.47 # Backward-rewritten : 7
% 0.17/0.47 # Generated clauses : 1330
% 0.17/0.47 # ...of the previous two non-redundant : 1217
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 1
% 0.17/0.47 # Paramodulations : 1283
% 0.17/0.47 # Factorizations : 2
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 45
% 0.17/0.47 # Total rewrite steps : 284
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 125
% 0.17/0.47 # Positive orientable unit clauses : 22
% 0.17/0.47 # Positive unorientable unit clauses: 6
% 0.17/0.47 # Negative unit clauses : 28
% 0.17/0.47 # Non-unit-clauses : 69
% 0.17/0.47 # Current number of unprocessed clauses: 861
% 0.17/0.47 # ...number of literals in the above : 1604
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 45
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 824
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 624
% 0.17/0.47 # Non-unit clause-clause subsumptions : 97
% 0.17/0.47 # Unit Clause-clause subsumption calls : 254
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 63
% 0.17/0.47 # BW rewrite match successes : 49
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 10344
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.021 s
% 0.17/0.47 # System time : 0.003 s
% 0.17/0.47 # Total time : 0.024 s
% 0.17/0.47 # Maximum resident set size: 1868 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.102 s
% 0.17/0.47 # System time : 0.009 s
% 0.17/0.47 # Total time : 0.112 s
% 0.17/0.47 # Maximum resident set size: 1744 pages
% 0.17/0.47 % E---3.1 exiting
% 0.17/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------