TSTP Solution File: NUM765_8 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM765_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : Tue May 21 01:27:59 EDT 2024
% Result : Theorem 0.18s 0.45s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 42 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 93 ( 44 ~; 26 |; 3 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 48 !; 0 ?; 48 :)
% 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,
u: frac ).
tff(decl_26,type,
moref: ( frac * frac ) > $o ).
tff(decl_27,type,
eq: ( frac * frac ) > $o ).
tff(decl_28,type,
pf: ( frac * frac ) > frac ).
tff(satz66,conjecture,
( ~ moref(pf(x,z),pf(y,u))
=> eq(pf(x,z),pf(y,u)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz66) ).
tff(satz65a,axiom,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( ( ~ moref(X2,X3)
=> eq(X2,X3) )
=> ( moref(X4,X5)
=> moref(pf(X2,X4),pf(X3,X5)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz65a) ).
tff(satz65b,axiom,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( moref(X2,X3)
=> ( ( ~ moref(X4,X5)
=> eq(X4,X5) )
=> moref(pf(X2,X4),pf(X3,X5)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz65b) ).
tff(m,axiom,
( ~ moref(x,y)
=> eq(x,y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
tff(n,axiom,
( ~ moref(z,u)
=> eq(z,u) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n) ).
tff(satz56,axiom,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( eq(X2,X3)
=> ( eq(X4,X5)
=> eq(pf(X2,X4),pf(X3,X5)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz56) ).
tff(c_0_6,negated_conjecture,
~ ( ~ moref(pf(x,z),pf(y,u))
=> eq(pf(x,z),pf(y,u)) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz66])]) ).
tff(c_0_7,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( ( ~ moref(X2,X3)
=> eq(X2,X3) )
=> ( moref(X4,X5)
=> moref(pf(X2,X4),pf(X3,X5)) ) ),
inference(fof_simplification,[status(thm)],[satz65a]) ).
tff(c_0_8,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( moref(X2,X3)
=> ( ( ~ moref(X4,X5)
=> eq(X4,X5) )
=> moref(pf(X2,X4),pf(X3,X5)) ) ),
inference(fof_simplification,[status(thm)],[satz65b]) ).
tff(c_0_9,negated_conjecture,
( ~ moref(pf(x,z),pf(y,u))
& ~ eq(pf(x,z),pf(y,u)) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
tff(c_0_10,plain,
! [X14: frac,X15: frac,X16: frac,X17: frac] :
( ( ~ moref(X14,X15)
| ~ moref(X16,X17)
| moref(pf(X14,X16),pf(X15,X17)) )
& ( ~ eq(X14,X15)
| ~ moref(X16,X17)
| moref(pf(X14,X16),pf(X15,X17)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
tff(c_0_11,plain,
( ~ moref(x,y)
=> eq(x,y) ),
inference(fof_simplification,[status(thm)],[m]) ).
tff(c_0_12,plain,
! [X10: frac,X11: frac,X12: frac,X13: frac] :
( ( ~ moref(X12,X13)
| moref(pf(X10,X12),pf(X11,X13))
| ~ moref(X10,X11) )
& ( ~ eq(X12,X13)
| moref(pf(X10,X12),pf(X11,X13))
| ~ moref(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
tff(c_0_13,plain,
( ~ moref(z,u)
=> eq(z,u) ),
inference(fof_simplification,[status(thm)],[n]) ).
tcf(c_0_14,negated_conjecture,
~ moref(pf(x,z),pf(y,u)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_15,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( moref(pf(X2,X4),pf(X3,X5))
| ~ eq(X2,X3)
| ~ moref(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tff(c_0_16,plain,
( moref(x,y)
| eq(x,y) ),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
tcf(c_0_17,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( moref(pf(X4,X2),pf(X5,X3))
| ~ moref(X2,X3)
| ~ moref(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tff(c_0_18,plain,
! [X6: frac,X7: frac,X8: frac,X9: frac] :
( ~ eq(X6,X7)
| ~ eq(X8,X9)
| eq(pf(X6,X8),pf(X7,X9)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz56])])]) ).
tff(c_0_19,plain,
( moref(z,u)
| eq(z,u) ),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
tcf(c_0_20,negated_conjecture,
( ~ eq(x,y)
| ~ moref(z,u) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
tcf(c_0_21,plain,
( moref(x,y)
| eq(x,y) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_22,negated_conjecture,
( ~ moref(x,y)
| ~ moref(z,u) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
tcf(c_0_23,negated_conjecture,
~ eq(pf(x,z),pf(y,u)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_24,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( eq(pf(X2,X4),pf(X3,X5))
| ~ eq(X2,X3)
| ~ eq(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_25,plain,
( moref(z,u)
| eq(z,u) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_26,negated_conjecture,
~ moref(z,u),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
tcf(c_0_27,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( moref(pf(X4,X2),pf(X5,X3))
| ~ eq(X2,X3)
| ~ moref(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_28,negated_conjecture,
( ~ eq(z,u)
| ~ eq(x,y) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
tcf(c_0_29,plain,
eq(z,u),
inference(sr,[status(thm)],[c_0_25,c_0_26]) ).
tcf(c_0_30,negated_conjecture,
( ~ eq(z,u)
| ~ moref(x,y) ),
inference(spm,[status(thm)],[c_0_14,c_0_27]) ).
tcf(c_0_31,negated_conjecture,
~ eq(x,y),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
tcf(c_0_32,negated_conjecture,
~ moref(x,y),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_29])]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_21,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM765_8 : TPTP v8.2.0. Released v8.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon May 20 07:32:53 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.18/0.44 Running first-order model finding
% 0.18/0.44 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Version: 3.1.0
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # Starting sh5l with 300s (1) cores
% 0.18/0.45 # new_bool_1 with pid 21591 completed with status 0
% 0.18/0.45 # Result found by new_bool_1
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.45 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.18/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.45 # SAT001_MinMin_p005000_rr_RG with pid 21595 completed with status 0
% 0.18/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.45 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.18/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.45 # Preprocessing time : 0.001 s
% 0.18/0.45 # Presaturation interreduction done
% 0.18/0.45
% 0.18/0.45 # Proof found!
% 0.18/0.45 # SZS status Theorem
% 0.18/0.45 # SZS output start CNFRefutation
% See solution above
% 0.18/0.45 # Parsed axioms : 15
% 0.18/0.45 # Removed by relevancy pruning/SinE : 9
% 0.18/0.45 # Initial clauses : 9
% 0.18/0.45 # Removed in clause preprocessing : 0
% 0.18/0.45 # Initial clauses in saturation : 9
% 0.18/0.45 # Processed clauses : 26
% 0.18/0.45 # ...of these trivial : 0
% 0.18/0.45 # ...subsumed : 1
% 0.18/0.45 # ...remaining for further processing : 24
% 0.18/0.45 # Other redundant clauses eliminated : 0
% 0.18/0.45 # Clauses deleted for lack of memory : 0
% 0.18/0.45 # Backward-subsumed : 2
% 0.18/0.45 # Backward-rewritten : 2
% 0.18/0.45 # Generated clauses : 9
% 0.18/0.45 # ...of the previous two non-redundant : 11
% 0.18/0.45 # ...aggressively subsumed : 0
% 0.18/0.45 # Contextual simplify-reflections : 1
% 0.18/0.45 # Paramodulations : 7
% 0.18/0.45 # Factorizations : 0
% 0.18/0.45 # NegExts : 0
% 0.18/0.45 # Equation resolutions : 0
% 0.18/0.45 # Disequality decompositions : 0
% 0.18/0.45 # Total rewrite steps : 2
% 0.18/0.45 # ...of those cached : 1
% 0.18/0.45 # Propositional unsat checks : 0
% 0.18/0.45 # Propositional check models : 0
% 0.18/0.45 # Propositional check unsatisfiable : 0
% 0.18/0.45 # Propositional clauses : 0
% 0.18/0.45 # Propositional clauses after purity: 0
% 0.18/0.45 # Propositional unsat core size : 0
% 0.18/0.45 # Propositional preprocessing time : 0.000
% 0.18/0.45 # Propositional encoding time : 0.000
% 0.18/0.45 # Propositional solver time : 0.000
% 0.18/0.45 # Success case prop preproc time : 0.000
% 0.18/0.45 # Success case prop encoding time : 0.000
% 0.18/0.45 # Success case prop solver time : 0.000
% 0.18/0.45 # Current number of processed clauses : 10
% 0.18/0.45 # Positive orientable unit clauses : 1
% 0.18/0.45 # Positive unorientable unit clauses: 0
% 0.18/0.45 # Negative unit clauses : 5
% 0.18/0.45 # Non-unit-clauses : 4
% 0.18/0.45 # Current number of unprocessed clauses: 2
% 0.18/0.45 # ...number of literals in the above : 4
% 0.18/0.45 # Current number of archived formulas : 0
% 0.18/0.45 # Current number of archived clauses : 14
% 0.18/0.45 # Clause-clause subsumption calls (NU) : 8
% 0.18/0.45 # Rec. Clause-clause subsumption calls : 8
% 0.18/0.45 # Non-unit clause-clause subsumptions : 2
% 0.18/0.45 # Unit Clause-clause subsumption calls : 6
% 0.18/0.45 # Rewrite failures with RHS unbound : 0
% 0.18/0.45 # BW rewrite match attempts : 1
% 0.18/0.45 # BW rewrite match successes : 1
% 0.18/0.45 # Condensation attempts : 0
% 0.18/0.45 # Condensation successes : 0
% 0.18/0.45 # Termbank termtop insertions : 821
% 0.18/0.45 # Search garbage collected termcells : 114
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.005 s
% 0.18/0.45 # System time : 0.001 s
% 0.18/0.45 # Total time : 0.006 s
% 0.18/0.45 # Maximum resident set size: 1740 pages
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.005 s
% 0.18/0.45 # System time : 0.004 s
% 0.18/0.45 # Total time : 0.009 s
% 0.18/0.45 # Maximum resident set size: 1712 pages
% 0.18/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------