TSTP Solution File: NUM755_8 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM755_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:07:41 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 34 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 74 ( 41 ~; 15 |; 2 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 42 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
frac: $tType ).
tff(decl_22,type,
x: frac ).
tff(decl_23,type,
y: frac ).
tff(decl_24,type,
z: frac ).
tff(decl_25,type,
moref: ( frac * frac ) > $o ).
tff(decl_26,type,
pf: ( frac * frac ) > frac ).
tff(decl_27,type,
eq: ( frac * frac ) > $o ).
tff(decl_28,type,
lessf: ( frac * frac ) > $o ).
tff(satz41b,axiom,
! [X2: frac,X3: frac] :
~ ( ( eq(X2,X3)
=> ~ moref(X2,X3) )
=> ~ ~ ( ( moref(X2,X3)
=> ~ lessf(X2,X3) )
=> ~ ( lessf(X2,X3)
=> ~ eq(X2,X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.tRmGRYyc9v/E---3.1_22928.p',satz41b) ).
tff(satz62c,axiom,
! [X2: frac,X3: frac,X4: frac] :
( lessf(X2,X3)
=> lessf(pf(X2,X4),pf(X3,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.tRmGRYyc9v/E---3.1_22928.p',satz62c) ).
tff(satz62b,axiom,
! [X2: frac,X3: frac,X4: frac] :
( eq(X2,X3)
=> eq(pf(X2,X4),pf(X3,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.tRmGRYyc9v/E---3.1_22928.p',satz62b) ).
tff(satz41a,axiom,
! [X2: frac,X3: frac] :
( ~ eq(X2,X3)
=> ( ~ moref(X2,X3)
=> lessf(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.tRmGRYyc9v/E---3.1_22928.p',satz41a) ).
tff(satz63a,conjecture,
moref(x,y),
file('/export/starexec/sandbox/tmp/tmp.tRmGRYyc9v/E---3.1_22928.p',satz63a) ).
tff(m,axiom,
moref(pf(x,z),pf(y,z)),
file('/export/starexec/sandbox/tmp/tmp.tRmGRYyc9v/E---3.1_22928.p',m) ).
tff(c_0_6,plain,
! [X2: frac,X3: frac] :
~ ( ( eq(X2,X3)
=> ~ moref(X2,X3) )
=> ~ ~ ( ( moref(X2,X3)
=> ~ lessf(X2,X3) )
=> ~ ( lessf(X2,X3)
=> ~ eq(X2,X3) ) ) ),
inference(fof_simplification,[status(thm)],[satz41b]) ).
tff(c_0_7,plain,
! [X5: frac,X6: frac] :
( ( ~ eq(X5,X6)
| ~ moref(X5,X6) )
& ( ~ moref(X5,X6)
| ~ lessf(X5,X6) )
& ( ~ lessf(X5,X6)
| ~ eq(X5,X6) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
tff(c_0_8,plain,
! [X10: frac,X11: frac,X12: frac] :
( ~ lessf(X10,X11)
| lessf(pf(X10,X12),pf(X11,X12)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz62c])])]) ).
tff(c_0_9,plain,
! [X7: frac,X8: frac,X9: frac] :
( ~ eq(X7,X8)
| eq(pf(X7,X9),pf(X8,X9)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz62b])])]) ).
tcf(c_0_10,plain,
! [X2: frac,X3: frac] :
( ~ moref(X2,X3)
| ~ lessf(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,plain,
! [X2: frac,X4: frac,X3: frac] :
( lessf(pf(X2,X4),pf(X3,X4))
| ~ lessf(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tff(c_0_12,plain,
! [X2: frac,X3: frac] :
( ~ eq(X2,X3)
=> ( ~ moref(X2,X3)
=> lessf(X2,X3) ) ),
inference(fof_simplification,[status(thm)],[satz41a]) ).
tcf(c_0_13,plain,
! [X2: frac,X3: frac] :
( ~ eq(X2,X3)
| ~ moref(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_14,plain,
! [X2: frac,X4: frac,X3: frac] :
( eq(pf(X2,X4),pf(X3,X4))
| ~ eq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tff(c_0_15,negated_conjecture,
~ moref(x,y),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz63a])]) ).
tcf(c_0_16,plain,
! [X2: frac,X3: frac,X4: frac] :
( ~ lessf(X2,X3)
| ~ moref(pf(X2,X4),pf(X3,X4)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
tcf(c_0_17,plain,
moref(pf(x,z),pf(y,z)),
inference(split_conjunct,[status(thm)],[m]) ).
tff(c_0_18,plain,
! [X13: frac,X14: frac] :
( eq(X13,X14)
| moref(X13,X14)
| lessf(X13,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
tcf(c_0_19,plain,
! [X2: frac,X3: frac,X4: frac] :
( ~ eq(X2,X3)
| ~ moref(pf(X2,X4),pf(X3,X4)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
tff(c_0_20,negated_conjecture,
~ moref(x,y),
inference(fof_nnf,[status(thm)],[c_0_15]) ).
tcf(c_0_21,plain,
~ lessf(x,y),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
tcf(c_0_22,plain,
! [X2: frac,X3: frac] :
( eq(X2,X3)
| moref(X2,X3)
| lessf(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_23,plain,
~ eq(x,y),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
tcf(c_0_24,negated_conjecture,
~ moref(x,y),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : NUM755_8 : TPTP v8.1.2. Released v8.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 09:09:31 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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.tRmGRYyc9v/E---3.1_22928.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23005 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.51 # Starting sh5l with 136s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23011 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 15
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 17
% 0.20/0.51 # Removed in clause preprocessing : 9
% 0.20/0.51 # Initial clauses in saturation : 8
% 0.20/0.51 # Processed clauses : 20
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 20
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 8
% 0.20/0.51 # ...of the previous two non-redundant : 5
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 8
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 0
% 0.20/0.51 # ...of those cached : 0
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 12
% 0.20/0.51 # Positive orientable unit clauses : 1
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 3
% 0.20/0.51 # Non-unit-clauses : 8
% 0.20/0.51 # Current number of unprocessed clauses: 1
% 0.20/0.51 # ...number of literals in the above : 2
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 8
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 4
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 2
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 0
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 780
% 0.20/0.51 # Search garbage collected termcells : 86
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.005 s
% 0.20/0.51 # System time : 0.001 s
% 0.20/0.51 # Total time : 0.006 s
% 0.20/0.51 # Maximum resident set size: 1696 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.013 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.017 s
% 0.20/0.51 # Maximum resident set size: 1716 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------