TSTP Solution File: NUM739_8 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM739_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 19:08:24 EDT 2023
% Result : Timeout 0.27s 300.16s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 40 ( 12 unt; 6 typ; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 63 ( 30 ~; 22 |; 1 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 35 ( 0 sgn; 35 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
x: frac ).
tff(decl_23,type,
y: frac ).
tff(decl_24,type,
z: frac ).
tff(decl_25,type,
u: frac ).
tff(decl_26,type,
moref: ( frac * frac ) > $o ).
tff(decl_27,type,
eq: ( frac * frac ) > $o ).
tff(satz39,axiom,
! [X2: frac,X3: frac,X4: frac] :
( eq(X2,X3)
=> ( eq(X3,X4)
=> eq(X2,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.1hDjLn8Vbj/E---3.1_6893.p',satz39) ).
tff(satz38,axiom,
! [X2: frac,X3: frac] :
( eq(X2,X3)
=> eq(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.1hDjLn8Vbj/E---3.1_6893.p',satz38) ).
tff(satz44,axiom,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( moref(X2,X3)
=> ( eq(X2,X4)
=> ( eq(X3,X5)
=> moref(X4,X5) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.1hDjLn8Vbj/E---3.1_6893.p',satz44) ).
tff(f,axiom,
eq(y,u),
file('/export/starexec/sandbox/tmp/tmp.1hDjLn8Vbj/E---3.1_6893.p',f) ).
tff(satz46,conjecture,
( ~ moref(z,u)
=> eq(z,u) ),
file('/export/starexec/sandbox/tmp/tmp.1hDjLn8Vbj/E---3.1_6893.p',satz46) ).
tff(m,axiom,
( ~ moref(x,y)
=> eq(x,y) ),
file('/export/starexec/sandbox/tmp/tmp.1hDjLn8Vbj/E---3.1_6893.p',m) ).
tff(e,axiom,
eq(x,z),
file('/export/starexec/sandbox/tmp/tmp.1hDjLn8Vbj/E---3.1_6893.p',e) ).
tff(c_0_7,plain,
! [X6: frac,X7: frac,X8: frac] :
( ~ eq(X6,X7)
| ~ eq(X7,X8)
| eq(X6,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz39])]) ).
tff(c_0_8,plain,
! [X9: frac,X10: frac] :
( ~ eq(X9,X10)
| eq(X10,X9) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz38])]) ).
tff(c_0_9,plain,
! [X11: frac,X12: frac,X13: frac,X14: frac] :
( ~ moref(X11,X12)
| ~ eq(X11,X13)
| ~ eq(X12,X14)
| moref(X13,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz44])]) ).
tcf(c_0_10,plain,
! [X2: frac,X3: frac,X4: frac] :
( eq(X2,X4)
| ~ eq(X2,X3)
| ~ eq(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,plain,
eq(y,u),
inference(split_conjunct,[status(thm)],[f]) ).
tff(c_0_12,negated_conjecture,
~ ( ~ moref(z,u)
=> eq(z,u) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz46])]) ).
tcf(c_0_13,plain,
! [X2: frac,X3: frac] :
( eq(X3,X2)
| ~ eq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_14,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( moref(X4,X5)
| ~ moref(X2,X3)
| ~ eq(X2,X4)
| ~ eq(X3,X5) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_15,plain,
! [X2: frac] :
( eq(X2,u)
| ~ eq(X2,y) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
tff(c_0_16,negated_conjecture,
( ~ moref(z,u)
& ~ eq(z,u) ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
tff(c_0_17,plain,
( ~ moref(x,y)
=> eq(x,y) ),
inference(fof_simplification,[status(thm)],[m]) ).
tcf(c_0_18,plain,
eq(u,y),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
tcf(c_0_19,plain,
! [X2: frac,X4: frac,X3: frac] :
( moref(X2,u)
| ~ eq(X3,y)
| ~ eq(X4,X2)
| ~ moref(X4,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
tcf(c_0_20,plain,
eq(x,z),
inference(split_conjunct,[status(thm)],[e]) ).
tcf(c_0_21,negated_conjecture,
~ moref(z,u),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tff(c_0_22,plain,
( moref(x,y)
| eq(x,y) ),
inference(fof_nnf,[status(thm)],[c_0_17]) ).
tcf(c_0_23,plain,
! [X2: frac] :
( eq(X2,y)
| ~ eq(X2,u) ),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
tcf(c_0_24,plain,
! [X2: frac] :
( ~ eq(X2,y)
| ~ moref(x,X2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
tcf(c_0_25,plain,
( moref(x,y)
| eq(x,y) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
tcf(c_0_26,plain,
eq(y,y),
inference(spm,[status(thm)],[c_0_23,c_0_11]) ).
tcf(c_0_27,plain,
! [X2: frac] :
( eq(u,X2)
| ~ eq(X2,y) ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
tcf(c_0_28,plain,
eq(x,y),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
tcf(c_0_29,plain,
! [X2: frac] :
( eq(X2,z)
| ~ eq(X2,x) ),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
tcf(c_0_30,plain,
eq(u,x),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
tcf(c_0_31,plain,
eq(u,z),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
tcf(c_0_32,negated_conjecture,
~ eq(z,u),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : NUM739_8 : TPTP v8.1.2. Released v8.0.0.
% 0.05/0.13 % Command : run_E %s %d THM
% 0.10/0.34 % Computer : n006.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8042.1875MB
% 0.10/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.34 % CPULimit : 2400
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Mon Oct 2 13:18:55 EDT 2023
% 0.10/0.34 % CPUTime :
% 0.16/0.45 Running first-order model finding
% 0.16/0.45 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.1hDjLn8Vbj/E---3.1_6893.p
% 0.27/300.16 # Version: 3.1pre001
% 0.27/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/300.16 # Starting new_bool_3 with 300s (1) cores
% 0.27/300.16 # Starting new_bool_1 with 300s (1) cores
% 0.27/300.16 # Starting sh5l with 300s (1) cores
% 0.27/300.16 # new_bool_1 with pid 6973 completed with status 0
% 0.27/300.16 # Result found by new_bool_1
% 0.27/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/300.16 # Starting new_bool_3 with 300s (1) cores
% 0.27/300.16 # Starting new_bool_1 with 300s (1) cores
% 0.27/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/300.16 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.27/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/300.16 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.27/300.16 # SAT001_MinMin_p005000_rr_RG with pid 6977 completed with status 0
% 0.27/300.16 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.27/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/300.16 # Starting new_bool_3 with 300s (1) cores
% 0.27/300.16 # Starting new_bool_1 with 300s (1) cores
% 0.27/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/300.16 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.27/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/300.16 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.27/300.16 # Preprocessing time : 0.001 s
% 0.27/300.16 # Presaturation interreduction done
% 0.27/300.16
% 0.27/300.16 # Proof found!
% 0.27/300.16 # SZS status Theorem
% 0.27/300.16 # SZS output start CNFRefutation
% See solution above
% 0.27/300.16 # Parsed axioms : 15
% 0.27/300.16 # Removed by relevancy pruning/SinE : 8
% 0.27/300.16 # Initial clauses : 8
% 0.27/300.16 # Removed in clause preprocessing : 0
% 0.27/300.16 # Initial clauses in saturation : 8
% 0.27/300.16 # Processed clauses : 47
% 0.27/300.16 # ...of these trivial : 0
% 0.27/300.16 # ...subsumed : 2
% 0.27/300.16 # ...remaining for further processing : 45
% 0.27/300.16 # Other redundant clauses eliminated : 0
% 0.27/300.16 # Clauses deleted for lack of memory : 0
% 0.27/300.16 # Backward-subsumed : 0
% 0.27/300.16 # Backward-rewritten : 1
% 0.27/300.16 # Generated clauses : 75
% 0.27/300.16 # ...of the previous two non-redundant : 51
% 0.27/300.16 # ...aggressively subsumed : 0
% 0.27/300.16 # Contextual simplify-reflections : 0
% 0.27/300.16 # Paramodulations : 75
% 0.27/300.16 # Factorizations : 0
% 0.27/300.16 # NegExts : 0
% 0.27/300.16 # Equation resolutions : 0
% 0.27/300.16 # Total rewrite steps : 12
% 0.27/300.16 # Propositional unsat checks : 0
% 0.27/300.16 # Propositional check models : 0
% 0.27/300.16 # Propositional check unsatisfiable : 0
% 0.27/300.16 # Propositional clauses : 0
% 0.27/300.16 # Propositional clauses after purity: 0
% 0.27/300.16 # Propositional unsat core size : 0
% 0.27/300.16 # Propositional preprocessing time : 0.000
% 0.27/300.16 # Propositional encoding time : 0.000
% 0.27/300.16 # Propositional solver time : 0.000
% 0.27/300.16 # Success case prop preproc time : 0.000
% 0.27/300.16 # Success case prop encoding time : 0.000
% 0.27/300.16 # Success case prop solver time : 0.000
% 0.27/300.16 # Current number of processed clauses : 36
% 0.27/300.16 # Positive orientable unit clauses : 11
% 0.27/300.16 # Positive unorientable unit clauses: 0
% 0.27/300.16 # Negative unit clauses : 3
% 0.27/300.16 # Non-unit-clauses : 22
% 0.27/300.16 # Current number of unprocessed clauses: 20
% 0.27/300.16 # ...number of literals in the above : 56
% 0.27/300.16 # Current number of archived formulas : 0
% 0.27/300.16 # Current number of archived clauses : 9
% 0.27/300.16 # Clause-clause subsumption calls (NU) : 73
% 0.27/300.16 # Rec. Clause-clause subsumption calls : 70
% 0.27/300.16 # Non-unit clause-clause subsumptions : 2
% 0.27/300.16 # Unit Clause-clause subsumption calls : 3
% 0.27/300.16 # Rewrite failures with RHS unbound : 0
% 0.27/300.16 # BW rewrite match attempts : 1
% 0.27/300.16 # BW rewrite match successes : 1
% 0.27/300.16 # Condensation attempts : 0
% 0.27/300.16 # Condensation successes : 0
% 0.27/300.16 # Termbank termtop insertions : 1278
% 0.27/300.16
% 0.27/300.16 # -------------------------------------------------
% 0.27/300.16 # User time : 0.005 s
% 0.27/300.16 # System time : 0.000 s
% 0.27/300.16 # Total time : 0.005 s
% 0.27/300.16 # Maximum resident set size: 1740 pages
% 0.27/300.16
% 0.27/300.16 # -------------------------------------------------
% 0.27/300.16 # User time : 0.006 s
% 0.27/300.16 # System time : 0.001 s
% 0.27/300.16 # Total time : 0.007 s
% 0.27/300.16 # Maximum resident set size: 1708 pages
% 0.27/300.16 % E---3.1 exiting
%------------------------------------------------------------------------------