TSTP Solution File: ROB015-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : ROB015-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 19:15:55 EDT 2023
% Result : Unsatisfiable 30.27s 4.39s
% Output : CNFRefutation 30.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 22 ( 12 unt; 0 nHn; 19 RR)
% Number of literals : 34 ( 29 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 10 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(lemma_3_4,axiom,
( negate(add(X1,negate(add(X2,multiply(X4,add(X1,X3)))))) = X3
| negate(add(X1,negate(X2))) != X3
| ~ positive_integer(X4) ),
file('/export/starexec/sandbox/tmp/tmp.X4lH4ctAZX/E---3.1_29892.p',lemma_3_4) ).
cnf(k_positive,axiom,
positive_integer(k),
file('/export/starexec/sandbox/tmp/tmp.X4lH4ctAZX/E---3.1_29892.p',k_positive) ).
cnf(lemma_3_2,axiom,
( X1 = X2
| negate(add(X1,negate(add(X2,X3)))) != negate(add(X2,negate(add(X1,X3)))) ),
file('/export/starexec/sandbox/tmp/tmp.X4lH4ctAZX/E---3.1_29892.p',lemma_3_2) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.X4lH4ctAZX/E---3.1_29892.p',commutativity_of_add) ).
cnf(condition,hypothesis,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
file('/export/starexec/sandbox/tmp/tmp.X4lH4ctAZX/E---3.1_29892.p',condition) ).
cnf(base_step,axiom,
negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) != negate(e),
file('/export/starexec/sandbox/tmp/tmp.X4lH4ctAZX/E---3.1_29892.p',base_step) ).
cnf(c_0_6,axiom,
( negate(add(X1,negate(add(X2,multiply(X4,add(X1,X3)))))) = X3
| negate(add(X1,negate(X2))) != X3
| ~ positive_integer(X4) ),
lemma_3_4 ).
cnf(c_0_7,axiom,
positive_integer(k),
k_positive ).
cnf(c_0_8,axiom,
( X1 = X2
| negate(add(X1,negate(add(X2,X3)))) != negate(add(X2,negate(add(X1,X3)))) ),
lemma_3_2 ).
cnf(c_0_9,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_10,plain,
( negate(add(X1,negate(add(X2,multiply(k,add(X1,X3)))))) = X3
| negate(add(X1,negate(X2))) != X3 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
( X1 = X2
| negate(add(X1,negate(add(X2,X3)))) != negate(add(negate(add(X1,X3)),X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,hypothesis,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
condition ).
cnf(c_0_13,plain,
( negate(add(X1,negate(add(X2,multiply(k,add(X1,X3)))))) = X3
| negate(add(negate(X2),X1)) != X3 ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_14,hypothesis,
( negate(e) = X1
| negate(add(negate(e),negate(add(X1,negate(add(d,negate(e))))))) != negate(add(d,X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,hypothesis,
( negate(add(negate(add(d,negate(e))),negate(add(e,multiply(k,add(negate(add(d,negate(e))),X1)))))) = X1
| d != X1 ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_16,hypothesis,
( negate(e) = X1
| negate(add(negate(e),negate(add(negate(add(d,negate(e))),X1)))) != negate(add(d,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_17,hypothesis,
negate(add(negate(add(d,negate(e))),negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))))) = d,
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_15]),c_0_9]) ).
cnf(c_0_18,axiom,
negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) != negate(e),
base_step ).
cnf(c_0_19,hypothesis,
negate(add(d,negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))))) != negate(add(d,negate(e))),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_9]),c_0_18]) ).
cnf(c_0_20,plain,
negate(add(X1,negate(add(X2,multiply(k,add(X1,negate(add(X1,negate(X2))))))))) = negate(add(X1,negate(X2))),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_21,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : ROB015-2 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n013.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 : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 00:27:29 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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/tmp/tmp.X4lH4ctAZX/E---3.1_29892.p
% 30.27/4.39 # Version: 3.1pre001
% 30.27/4.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 30.27/4.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.27/4.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 30.27/4.39 # Starting new_bool_3 with 300s (1) cores
% 30.27/4.39 # Starting new_bool_1 with 300s (1) cores
% 30.27/4.39 # Starting sh5l with 300s (1) cores
% 30.27/4.39 # new_bool_1 with pid 29973 completed with status 0
% 30.27/4.39 # Result found by new_bool_1
% 30.27/4.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 30.27/4.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.27/4.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 30.27/4.39 # Starting new_bool_3 with 300s (1) cores
% 30.27/4.39 # Starting new_bool_1 with 300s (1) cores
% 30.27/4.39 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 30.27/4.39 # Search class: FHUSS-FFSF21-DFFFFFNN
% 30.27/4.39 # partial match(1): FHUSS-FFSF21-SFFFFFNN
% 30.27/4.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 30.27/4.39 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 30.27/4.39 # G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with pid 29981 completed with status 0
% 30.27/4.39 # Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 30.27/4.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 30.27/4.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.27/4.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 30.27/4.39 # Starting new_bool_3 with 300s (1) cores
% 30.27/4.39 # Starting new_bool_1 with 300s (1) cores
% 30.27/4.39 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 30.27/4.39 # Search class: FHUSS-FFSF21-DFFFFFNN
% 30.27/4.39 # partial match(1): FHUSS-FFSF21-SFFFFFNN
% 30.27/4.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 30.27/4.39 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 30.27/4.39 # Preprocessing time : 0.001 s
% 30.27/4.39 # Presaturation interreduction done
% 30.27/4.39
% 30.27/4.39 # Proof found!
% 30.27/4.39 # SZS status Unsatisfiable
% 30.27/4.39 # SZS output start CNFRefutation
% See solution above
% 30.27/4.39 # Parsed axioms : 13
% 30.27/4.39 # Removed by relevancy pruning/SinE : 2
% 30.27/4.39 # Initial clauses : 11
% 30.27/4.39 # Removed in clause preprocessing : 0
% 30.27/4.39 # Initial clauses in saturation : 11
% 30.27/4.39 # Processed clauses : 1956
% 30.27/4.39 # ...of these trivial : 780
% 30.27/4.39 # ...subsumed : 708
% 30.27/4.39 # ...remaining for further processing : 468
% 30.27/4.39 # Other redundant clauses eliminated : 1513
% 30.27/4.39 # Clauses deleted for lack of memory : 0
% 30.27/4.39 # Backward-subsumed : 0
% 30.27/4.39 # Backward-rewritten : 1
% 30.27/4.39 # Generated clauses : 126664
% 30.27/4.39 # ...of the previous two non-redundant : 122799
% 30.27/4.39 # ...aggressively subsumed : 0
% 30.27/4.39 # Contextual simplify-reflections : 0
% 30.27/4.39 # Paramodulations : 125047
% 30.27/4.39 # Factorizations : 0
% 30.27/4.39 # NegExts : 0
% 30.27/4.39 # Equation resolutions : 1617
% 30.27/4.39 # Total rewrite steps : 198789
% 30.27/4.39 # Propositional unsat checks : 0
% 30.27/4.39 # Propositional check models : 0
% 30.27/4.39 # Propositional check unsatisfiable : 0
% 30.27/4.39 # Propositional clauses : 0
% 30.27/4.39 # Propositional clauses after purity: 0
% 30.27/4.39 # Propositional unsat core size : 0
% 30.27/4.39 # Propositional preprocessing time : 0.000
% 30.27/4.39 # Propositional encoding time : 0.000
% 30.27/4.39 # Propositional solver time : 0.000
% 30.27/4.39 # Success case prop preproc time : 0.000
% 30.27/4.39 # Success case prop encoding time : 0.000
% 30.27/4.39 # Success case prop solver time : 0.000
% 30.27/4.39 # Current number of processed clauses : 456
% 30.27/4.39 # Positive orientable unit clauses : 274
% 30.27/4.39 # Positive unorientable unit clauses: 4
% 30.27/4.39 # Negative unit clauses : 3
% 30.27/4.39 # Non-unit-clauses : 175
% 30.27/4.39 # Current number of unprocessed clauses: 120865
% 30.27/4.39 # ...number of literals in the above : 140949
% 30.27/4.39 # Current number of archived formulas : 0
% 30.27/4.39 # Current number of archived clauses : 12
% 30.27/4.39 # Clause-clause subsumption calls (NU) : 5786
% 30.27/4.39 # Rec. Clause-clause subsumption calls : 5785
% 30.27/4.39 # Non-unit clause-clause subsumptions : 379
% 30.27/4.39 # Unit Clause-clause subsumption calls : 1171
% 30.27/4.39 # Rewrite failures with RHS unbound : 0
% 30.27/4.39 # BW rewrite match attempts : 34669
% 30.27/4.39 # BW rewrite match successes : 13
% 30.27/4.39 # Condensation attempts : 0
% 30.27/4.39 # Condensation successes : 0
% 30.27/4.39 # Termbank termtop insertions : 5289817
% 30.27/4.39
% 30.27/4.39 # -------------------------------------------------
% 30.27/4.39 # User time : 3.665 s
% 30.27/4.39 # System time : 0.118 s
% 30.27/4.39 # Total time : 3.783 s
% 30.27/4.39 # Maximum resident set size: 1628 pages
% 30.27/4.39
% 30.27/4.39 # -------------------------------------------------
% 30.27/4.39 # User time : 3.667 s
% 30.27/4.39 # System time : 0.119 s
% 30.27/4.39 # Total time : 3.786 s
% 30.27/4.39 # Maximum resident set size: 1688 pages
% 30.27/4.39 % E---3.1 exiting
% 30.27/4.39 % E---3.1 exiting
%------------------------------------------------------------------------------