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