TSTP Solution File: NUM761_8 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM761_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:58 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 27 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 14 ~; 10 |; 0 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 24 ( 0 sgn 24 !; 0 ?; 24 :)
% 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(satz65a,conjecture,
moref(pf(x,z),pf(y,u)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz65a) ).
tff(m,axiom,
( ~ moref(x,y)
=> eq(x,y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
tff(satz64,axiom,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( moref(X2,X3)
=> ( moref(X4,X5)
=> moref(pf(X2,X4),pf(X3,X5)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz64) ).
tff(n,axiom,
moref(z,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n) ).
tff(satz62g,axiom,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( eq(X2,X3)
=> ( moref(X4,X5)
=> moref(pf(X2,X4),pf(X3,X5)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz62g) ).
tff(c_0_5,negated_conjecture,
~ moref(pf(x,z),pf(y,u)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz65a])]) ).
tff(c_0_6,plain,
( ~ moref(x,y)
=> eq(x,y) ),
inference(fof_simplification,[status(thm)],[m]) ).
tff(c_0_7,negated_conjecture,
~ moref(pf(x,z),pf(y,u)),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
tff(c_0_8,plain,
! [X10: frac,X11: frac,X12: frac,X13: frac] :
( ~ moref(X10,X11)
| ~ moref(X12,X13)
| moref(pf(X10,X12),pf(X11,X13)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz64])])]) ).
tff(c_0_9,plain,
( moref(x,y)
| eq(x,y) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
tcf(c_0_10,negated_conjecture,
~ moref(pf(x,z),pf(y,u)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( moref(pf(X2,X4),pf(X3,X5))
| ~ moref(X2,X3)
| ~ moref(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_12,plain,
moref(z,u),
inference(split_conjunct,[status(thm)],[n]) ).
tff(c_0_13,plain,
! [X6: frac,X7: frac,X8: frac,X9: frac] :
( ~ eq(X6,X7)
| ~ moref(X8,X9)
| moref(pf(X6,X8),pf(X7,X9)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz62g])])]) ).
tcf(c_0_14,plain,
( moref(x,y)
| eq(x,y) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_15,negated_conjecture,
~ moref(x,y),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
tcf(c_0_16,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_13]) ).
tcf(c_0_17,plain,
eq(x,y),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_17]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM761_8 : TPTP v8.2.0. Released v8.0.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n003.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 06:20:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # sh5l with pid 4022 completed with status 0
% 0.21/0.50 # Result found by sh5l
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 4023 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 14
% 0.21/0.50 # Removed by relevancy pruning/SinE : 9
% 0.21/0.50 # Initial clauses : 5
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 5
% 0.21/0.50 # Processed clauses : 12
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 12
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 3
% 0.21/0.50 # ...of the previous two non-redundant : 2
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 2
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 3
% 0.21/0.50 # ...of those cached : 1
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 6
% 0.21/0.50 # Positive orientable unit clauses : 2
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 2
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 6
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 2
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 2
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 1
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 404
% 0.21/0.50 # Search garbage collected termcells : 54
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.003 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.004 s
% 0.21/0.50 # Maximum resident set size: 1756 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.003 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.007 s
% 0.21/0.50 # Maximum resident set size: 1712 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------