TSTP Solution File: ROB005-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : ROB005-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:53 EDT 2023
% Result : Unsatisfiable 17.89s 2.80s
% Output : CNFRefutation 17.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 19 RR)
% Number of literals : 48 ( 47 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(robbins_axiom,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
file('/export/starexec/sandbox/tmp/tmp.xJz5q0JNmH/E---3.1_25435.p',robbins_axiom) ).
cnf(idempotence,hypothesis,
add(c,c) = c,
file('/export/starexec/sandbox/tmp/tmp.xJz5q0JNmH/E---3.1_25435.p',idempotence) ).
cnf(associativity_of_add,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.xJz5q0JNmH/E---3.1_25435.p',associativity_of_add) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.xJz5q0JNmH/E---3.1_25435.p',commutativity_of_add) ).
cnf(prove_huntingtons_axiom,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
file('/export/starexec/sandbox/tmp/tmp.xJz5q0JNmH/E---3.1_25435.p',prove_huntingtons_axiom) ).
cnf(c_0_5,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
robbins_axiom ).
cnf(c_0_6,hypothesis,
add(c,c) = c,
idempotence ).
cnf(c_0_7,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_8,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_9,hypothesis,
negate(add(negate(c),negate(add(c,negate(c))))) = c,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,plain,
add(X1,add(X2,X3)) = add(X2,add(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_7]) ).
cnf(c_0_11,hypothesis,
negate(add(c,negate(add(c,add(negate(c),negate(c)))))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_9]),c_0_10]),c_0_8]) ).
cnf(c_0_12,hypothesis,
add(c,add(c,X1)) = add(c,X1),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_13,hypothesis,
negate(add(negate(c),negate(add(c,add(negate(c),negate(c)))))) = c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_11]),c_0_12]),c_0_8]) ).
cnf(c_0_14,plain,
negate(add(negate(add(X1,X2)),negate(add(negate(X2),X1)))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_15,hypothesis,
negate(add(c,negate(add(c,add(negate(c),add(negate(c),negate(c))))))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_10]),c_0_8]) ).
cnf(c_0_16,plain,
negate(add(negate(add(X1,X2)),negate(add(negate(X1),X2)))) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_17,hypothesis,
negate(add(negate(c),negate(add(c,add(negate(c),add(negate(c),negate(c))))))) = c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_15]),c_0_12]),c_0_8]) ).
cnf(c_0_18,plain,
negate(add(negate(add(X1,add(X2,X3))),negate(add(X1,add(X2,negate(X3)))))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_7]),c_0_7]) ).
cnf(c_0_19,hypothesis,
negate(add(c,add(negate(c),negate(c)))) = negate(add(c,negate(c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_13]),c_0_8]),c_0_11]),c_0_8]) ).
cnf(c_0_20,hypothesis,
negate(add(negate(add(c,X1)),negate(add(c,add(negate(c),X1))))) = add(c,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_12]),c_0_10]) ).
cnf(c_0_21,hypothesis,
negate(add(c,add(negate(c),add(negate(c),negate(c))))) = negate(add(c,negate(c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_17]),c_0_8]),c_0_15]),c_0_8]) ).
cnf(c_0_22,hypothesis,
negate(add(negate(add(c,negate(c))),negate(add(c,negate(c))))) = add(c,negate(c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_8]),c_0_12]) ).
cnf(c_0_23,plain,
negate(add(negate(add(X1,X2)),negate(add(X2,negate(X1))))) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_24,hypothesis,
negate(add(negate(add(X1,c)),negate(add(X1,add(negate(c),negate(add(c,negate(c)))))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_9]),c_0_8]) ).
cnf(c_0_25,hypothesis,
add(c,add(negate(c),negate(c))) = add(c,negate(c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19]),c_0_22]) ).
cnf(c_0_26,plain,
negate(add(negate(add(X1,negate(X2))),negate(add(X2,X1)))) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_8]) ).
cnf(c_0_27,hypothesis,
negate(add(negate(c),negate(add(c,add(negate(c),negate(add(c,negate(c)))))))) = c,
inference(spm,[status(thm)],[c_0_24,c_0_6]) ).
cnf(c_0_28,hypothesis,
add(c,add(negate(c),add(negate(c),X1))) = add(c,add(negate(c),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_25]),c_0_7]),c_0_7]) ).
cnf(c_0_29,hypothesis,
negate(add(c,negate(add(c,add(negate(c),negate(add(c,negate(c)))))))) = negate(c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_7]),c_0_7]),c_0_8]),c_0_28]) ).
cnf(c_0_30,hypothesis,
negate(add(c,add(negate(c),negate(add(c,negate(c)))))) = negate(add(c,negate(c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_29]),c_0_27]),c_0_8]) ).
cnf(c_0_31,hypothesis,
negate(add(c,negate(add(c,negate(c))))) = negate(c),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_32,hypothesis,
add(c,negate(add(c,negate(c)))) = c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_30]),c_0_31]),c_0_9]) ).
cnf(c_0_33,hypothesis,
add(c,add(X1,negate(add(c,negate(c))))) = add(X1,c),
inference(spm,[status(thm)],[c_0_10,c_0_32]) ).
cnf(c_0_34,hypothesis,
add(X1,negate(add(c,negate(c)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_33]),c_0_7]),c_0_8]),c_0_24]) ).
cnf(c_0_35,plain,
negate(add(X1,negate(add(X1,add(negate(X2),negate(add(X1,X2))))))) = negate(add(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_5]),c_0_8]),c_0_7]),c_0_8]) ).
cnf(c_0_36,hypothesis,
add(negate(add(c,negate(c))),X1) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_34]) ).
cnf(c_0_37,plain,
negate(add(X1,negate(add(negate(add(X1,X2)),negate(negate(add(X1,negate(X2)))))))) = negate(add(X1,X2)),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_38,hypothesis,
negate(negate(add(negate(X1),negate(X1)))) = negate(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_36]),c_0_36]),c_0_36]) ).
cnf(c_0_39,plain,
negate(add(negate(add(X1,X2)),negate(add(X1,add(negate(add(X2,X3)),negate(add(X2,negate(X3)))))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_5]),c_0_8]) ).
cnf(c_0_40,hypothesis,
negate(negate(add(negate(X1),negate(negate(negate(X1)))))) = negate(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_36]),c_0_36]),c_0_36]),c_0_36]) ).
cnf(c_0_41,hypothesis,
negate(negate(add(X1,X1))) = X1,
inference(spm,[status(thm)],[c_0_38,c_0_5]) ).
cnf(c_0_42,hypothesis,
negate(add(X1,negate(X1))) = negate(add(c,negate(c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_36]),c_0_36]),c_0_5]),c_0_8]) ).
cnf(c_0_43,hypothesis,
negate(negate(add(X1,negate(negate(X1))))) = X1,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,hypothesis,
negate(negate(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_42]),c_0_34]),c_0_43]) ).
cnf(c_0_45,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
prove_huntingtons_axiom ).
cnf(c_0_46,hypothesis,
add(negate(add(X1,X2)),negate(add(negate(X1),X2))) = negate(X2),
inference(spm,[status(thm)],[c_0_44,c_0_16]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : ROB005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n011.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Oct 3 00:30:08 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 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.xJz5q0JNmH/E---3.1_25435.p
% 17.89/2.80 # Version: 3.1pre001
% 17.89/2.80 # Preprocessing class: FSSSSMSSSSSNFFN.
% 17.89/2.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.89/2.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 17.89/2.80 # Starting new_bool_3 with 300s (1) cores
% 17.89/2.80 # Starting new_bool_1 with 300s (1) cores
% 17.89/2.80 # Starting sh5l with 300s (1) cores
% 17.89/2.80 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 25513 completed with status 0
% 17.89/2.80 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 17.89/2.80 # Preprocessing class: FSSSSMSSSSSNFFN.
% 17.89/2.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.89/2.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 17.89/2.80 # No SInE strategy applied
% 17.89/2.80 # Search class: FUUPS-FFSF21-MFFFFFNN
% 17.89/2.80 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 17.89/2.80 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 17.89/2.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 17.89/2.80 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 17.89/2.80 # Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 17.89/2.80 # Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 17.89/2.80 # U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 25524 completed with status 0
% 17.89/2.80 # Result found by U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 17.89/2.80 # Preprocessing class: FSSSSMSSSSSNFFN.
% 17.89/2.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.89/2.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 17.89/2.80 # No SInE strategy applied
% 17.89/2.80 # Search class: FUUPS-FFSF21-MFFFFFNN
% 17.89/2.80 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 17.89/2.80 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 17.89/2.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 17.89/2.80 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 17.89/2.80 # Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 17.89/2.80 # Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 17.89/2.80 # Preprocessing time : 0.001 s
% 17.89/2.80 # Presaturation interreduction done
% 17.89/2.80
% 17.89/2.80 # Proof found!
% 17.89/2.80 # SZS status Unsatisfiable
% 17.89/2.80 # SZS output start CNFRefutation
% See solution above
% 17.89/2.80 # Parsed axioms : 5
% 17.89/2.80 # Removed by relevancy pruning/SinE : 0
% 17.89/2.80 # Initial clauses : 5
% 17.89/2.80 # Removed in clause preprocessing : 0
% 17.89/2.80 # Initial clauses in saturation : 5
% 17.89/2.80 # Processed clauses : 3251
% 17.89/2.80 # ...of these trivial : 1383
% 17.89/2.80 # ...subsumed : 1578
% 17.89/2.80 # ...remaining for further processing : 290
% 17.89/2.80 # Other redundant clauses eliminated : 0
% 17.89/2.80 # Clauses deleted for lack of memory : 0
% 17.89/2.80 # Backward-subsumed : 2
% 17.89/2.80 # Backward-rewritten : 108
% 17.89/2.80 # Generated clauses : 91340
% 17.89/2.80 # ...of the previous two non-redundant : 74240
% 17.89/2.80 # ...aggressively subsumed : 0
% 17.89/2.80 # Contextual simplify-reflections : 0
% 17.89/2.80 # Paramodulations : 91340
% 17.89/2.80 # Factorizations : 0
% 17.89/2.80 # NegExts : 0
% 17.89/2.80 # Equation resolutions : 0
% 17.89/2.80 # Total rewrite steps : 188304
% 17.89/2.80 # Propositional unsat checks : 0
% 17.89/2.80 # Propositional check models : 0
% 17.89/2.80 # Propositional check unsatisfiable : 0
% 17.89/2.80 # Propositional clauses : 0
% 17.89/2.80 # Propositional clauses after purity: 0
% 17.89/2.80 # Propositional unsat core size : 0
% 17.89/2.80 # Propositional preprocessing time : 0.000
% 17.89/2.80 # Propositional encoding time : 0.000
% 17.89/2.80 # Propositional solver time : 0.000
% 17.89/2.80 # Success case prop preproc time : 0.000
% 17.89/2.80 # Success case prop encoding time : 0.000
% 17.89/2.80 # Success case prop solver time : 0.000
% 17.89/2.80 # Current number of processed clauses : 175
% 17.89/2.80 # Positive orientable unit clauses : 170
% 17.89/2.80 # Positive unorientable unit clauses: 5
% 17.89/2.80 # Negative unit clauses : 0
% 17.89/2.80 # Non-unit-clauses : 0
% 17.89/2.80 # Current number of unprocessed clauses: 69920
% 17.89/2.80 # ...number of literals in the above : 69920
% 17.89/2.80 # Current number of archived formulas : 0
% 17.89/2.80 # Current number of archived clauses : 115
% 17.89/2.80 # Clause-clause subsumption calls (NU) : 0
% 17.89/2.80 # Rec. Clause-clause subsumption calls : 0
% 17.89/2.80 # Non-unit clause-clause subsumptions : 0
% 17.89/2.80 # Unit Clause-clause subsumption calls : 444
% 17.89/2.80 # Rewrite failures with RHS unbound : 0
% 17.89/2.80 # BW rewrite match attempts : 11301
% 17.89/2.80 # BW rewrite match successes : 571
% 17.89/2.80 # Condensation attempts : 0
% 17.89/2.80 # Condensation successes : 0
% 17.89/2.80 # Termbank termtop insertions : 2623238
% 17.89/2.80
% 17.89/2.80 # -------------------------------------------------
% 17.89/2.80 # User time : 2.118 s
% 17.89/2.80 # System time : 0.068 s
% 17.89/2.80 # Total time : 2.186 s
% 17.89/2.80 # Maximum resident set size: 1508 pages
% 17.89/2.80
% 17.89/2.80 # -------------------------------------------------
% 17.89/2.80 # User time : 10.554 s
% 17.89/2.80 # System time : 0.435 s
% 17.89/2.80 # Total time : 10.989 s
% 17.89/2.80 # Maximum resident set size: 1668 pages
% 17.89/2.80 % E---3.1 exiting
% 17.89/2.80 % E---3.1 exiting
%------------------------------------------------------------------------------