TSTP Solution File: NUM688_8 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM688_8 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:57:05 EDT 2023
% Result : Theorem 0.22s 0.50s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 26 ( 9 unt; 6 typ; 0 def)
% Number of atoms : 37 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 32 ( 15 ~; 11 |; 0 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn; 27 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
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(n,axiom,
( ~ more(z,u)
=> ( z = u ) ),
file('/export/starexec/sandbox2/tmp/tmp.w1JRRiaKD3/E---3.1_11149.p',n) ).
tff(satz22b,conjecture,
more(pl(x,z),pl(y,u)),
file('/export/starexec/sandbox2/tmp/tmp.w1JRRiaKD3/E---3.1_11149.p',satz22b) ).
tff(satz21,axiom,
! [X2: nat,X3: nat,X4: nat,X5: nat] :
( more(X2,X3)
=> ( more(X4,X5)
=> more(pl(X2,X4),pl(X3,X5)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.w1JRRiaKD3/E---3.1_11149.p',satz21) ).
tff(m,axiom,
more(x,y),
file('/export/starexec/sandbox2/tmp/tmp.w1JRRiaKD3/E---3.1_11149.p',m) ).
tff(satz19h,axiom,
! [X2: nat,X3: nat,X4: nat,X5: nat] :
( ( X2 = X3 )
=> ( more(X4,X5)
=> more(pl(X4,X2),pl(X5,X3)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.w1JRRiaKD3/E---3.1_11149.p',satz19h) ).
tff(c_0_5,plain,
( ~ more(z,u)
=> ( z = u ) ),
inference(fof_simplification,[status(thm)],[n]) ).
tff(c_0_6,negated_conjecture,
~ more(pl(x,z),pl(y,u)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz22b])]) ).
tff(c_0_7,plain,
! [X10: nat,X11: nat,X12: nat,X13: nat] :
( ~ more(X10,X11)
| ~ more(X12,X13)
| more(pl(X10,X12),pl(X11,X13)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz21])]) ).
tff(c_0_8,plain,
( more(z,u)
| ( z = u ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
tcf(c_0_9,negated_conjecture,
~ more(pl(x,z),pl(y,u)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
! [X2: nat,X3: nat,X4: nat,X5: nat] :
( more(pl(X2,X4),pl(X3,X5))
| ~ more(X2,X3)
| ~ more(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,plain,
more(x,y),
inference(split_conjunct,[status(thm)],[m]) ).
tcf(c_0_12,plain,
( more(z,u)
| ( z = u ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,negated_conjecture,
~ more(z,u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
tff(c_0_14,plain,
! [X6: nat,X7: nat,X8: nat,X9: nat] :
( ( X6 != X7 )
| ~ more(X8,X9)
| more(pl(X8,X6),pl(X9,X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz19h])]) ).
tcf(c_0_15,plain,
z = u,
inference(sr,[status(thm)],[c_0_12,c_0_13]) ).
tcf(c_0_16,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_14]) ).
tcf(c_0_17,negated_conjecture,
~ more(pl(x,u),pl(y,u)),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
tcf(c_0_18,plain,
! [X2: nat,X3: nat,X4: nat] :
( more(pl(X2,X3),pl(X4,X3))
| ~ more(X2,X4) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM688_8 : TPTP v8.1.2. Released v8.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n023.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 14:59:22 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.w1JRRiaKD3/E---3.1_11149.p
% 0.22/0.50 # Version: 3.1pre001
% 0.22/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # Starting sh5l with 300s (1) cores
% 0.22/0.50 # new_bool_1 with pid 11230 completed with status 0
% 0.22/0.50 # Result found by new_bool_1
% 0.22/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.50 # Search class: FGUSF-FFSF22-SFFFFFNN
% 0.22/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.50 # SAT001_MinMin_p005000_rr_RG with pid 11236 completed with status 0
% 0.22/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.50 # Search class: FGUSF-FFSF22-SFFFFFNN
% 0.22/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.50 # Preprocessing time : 0.001 s
% 0.22/0.50 # Presaturation interreduction done
% 0.22/0.50
% 0.22/0.50 # Proof found!
% 0.22/0.50 # SZS status Theorem
% 0.22/0.50 # SZS output start CNFRefutation
% See solution above
% 0.22/0.50 # Parsed axioms : 13
% 0.22/0.50 # Removed by relevancy pruning/SinE : 8
% 0.22/0.50 # Initial clauses : 5
% 0.22/0.50 # Removed in clause preprocessing : 0
% 0.22/0.50 # Initial clauses in saturation : 5
% 0.22/0.50 # Processed clauses : 15
% 0.22/0.50 # ...of these trivial : 0
% 0.22/0.50 # ...subsumed : 0
% 0.22/0.50 # ...remaining for further processing : 15
% 0.22/0.50 # Other redundant clauses eliminated : 1
% 0.22/0.50 # Clauses deleted for lack of memory : 0
% 0.22/0.50 # Backward-subsumed : 0
% 0.22/0.50 # Backward-rewritten : 1
% 0.22/0.50 # Generated clauses : 6
% 0.22/0.50 # ...of the previous two non-redundant : 5
% 0.22/0.50 # ...aggressively subsumed : 0
% 0.22/0.50 # Contextual simplify-reflections : 0
% 0.22/0.50 # Paramodulations : 4
% 0.22/0.50 # Factorizations : 0
% 0.22/0.50 # NegExts : 0
% 0.22/0.50 # Equation resolutions : 1
% 0.22/0.50 # Total rewrite steps : 3
% 0.22/0.50 # Propositional unsat checks : 0
% 0.22/0.50 # Propositional check models : 0
% 0.22/0.50 # Propositional check unsatisfiable : 0
% 0.22/0.50 # Propositional clauses : 0
% 0.22/0.50 # Propositional clauses after purity: 0
% 0.22/0.50 # Propositional unsat core size : 0
% 0.22/0.50 # Propositional preprocessing time : 0.000
% 0.22/0.50 # Propositional encoding time : 0.000
% 0.22/0.50 # Propositional solver time : 0.000
% 0.22/0.50 # Success case prop preproc time : 0.000
% 0.22/0.50 # Success case prop encoding time : 0.000
% 0.22/0.50 # Success case prop solver time : 0.000
% 0.22/0.50 # Current number of processed clauses : 7
% 0.22/0.50 # Positive orientable unit clauses : 2
% 0.22/0.50 # Positive unorientable unit clauses: 0
% 0.22/0.50 # Negative unit clauses : 3
% 0.22/0.50 # Non-unit-clauses : 2
% 0.22/0.50 # Current number of unprocessed clauses: 0
% 0.22/0.50 # ...number of literals in the above : 0
% 0.22/0.50 # Current number of archived formulas : 0
% 0.22/0.50 # Current number of archived clauses : 7
% 0.22/0.50 # Clause-clause subsumption calls (NU) : 6
% 0.22/0.50 # Rec. Clause-clause subsumption calls : 6
% 0.22/0.50 # Non-unit clause-clause subsumptions : 0
% 0.22/0.50 # Unit Clause-clause subsumption calls : 1
% 0.22/0.50 # Rewrite failures with RHS unbound : 0
% 0.22/0.50 # BW rewrite match attempts : 1
% 0.22/0.50 # BW rewrite match successes : 1
% 0.22/0.50 # Condensation attempts : 0
% 0.22/0.50 # Condensation successes : 0
% 0.22/0.50 # Termbank termtop insertions : 367
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.003 s
% 0.22/0.50 # System time : 0.003 s
% 0.22/0.50 # Total time : 0.005 s
% 0.22/0.50 # Maximum resident set size: 1756 pages
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.003 s
% 0.22/0.50 # System time : 0.006 s
% 0.22/0.50 # Total time : 0.009 s
% 0.22/0.50 # Maximum resident set size: 1704 pages
% 0.22/0.50 % E---3.1 exiting
% 0.22/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------