TSTP Solution File: ROB004-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : ROB004-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:16:08 EDT 2023
% Result : Unsatisfiable 0.16s 0.53s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 9 RR)
% Number of literals : 33 ( 32 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 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.Ornu1RKSBo/E---3.1_10275.p',robbins_axiom) ).
cnf(negate_d_is_c,hypothesis,
negate(d) = c,
file('/export/starexec/sandbox/tmp/tmp.Ornu1RKSBo/E---3.1_10275.p',negate_d_is_c) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.Ornu1RKSBo/E---3.1_10275.p',commutativity_of_add) ).
cnf(associativity_of_add,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.Ornu1RKSBo/E---3.1_10275.p',associativity_of_add) ).
cnf(c_plus_d_is_d,hypothesis,
add(c,d) = d,
file('/export/starexec/sandbox/tmp/tmp.Ornu1RKSBo/E---3.1_10275.p',c_plus_d_is_d) ).
cnf(c_plus_c_is_c,hypothesis,
add(c,c) = c,
file('/export/starexec/sandbox/tmp/tmp.Ornu1RKSBo/E---3.1_10275.p',c_plus_c_is_c) ).
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.Ornu1RKSBo/E---3.1_10275.p',prove_huntingtons_axiom) ).
cnf(c_0_7,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
robbins_axiom ).
cnf(c_0_8,hypothesis,
negate(d) = c,
negate_d_is_c ).
cnf(c_0_9,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_10,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_11,hypothesis,
add(c,d) = d,
c_plus_d_is_d ).
cnf(c_0_12,hypothesis,
negate(add(negate(add(X1,c)),negate(add(X1,d)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_13,hypothesis,
add(c,c) = c,
c_plus_c_is_c ).
cnf(c_0_14,hypothesis,
add(c,add(d,X1)) = add(d,X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,hypothesis,
negate(add(negate(add(c,X1)),negate(add(X1,d)))) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_16,hypothesis,
add(c,add(c,X1)) = add(c,X1),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_17,hypothesis,
add(c,add(X1,d)) = add(X1,d),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_18,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_7,c_0_7]),c_0_9]) ).
cnf(c_0_19,hypothesis,
add(c,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_10]),c_0_17]),c_0_15]) ).
cnf(c_0_20,hypothesis,
negate(add(X1,negate(X1))) = c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_19]),c_0_7]),c_0_9]) ).
cnf(c_0_21,hypothesis,
add(X1,c) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_19]) ).
cnf(c_0_22,hypothesis,
negate(negate(add(X1,X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_20]),c_0_21]) ).
cnf(c_0_23,hypothesis,
negate(add(X1,negate(add(X1,X1)))) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_22]),c_0_9]) ).
cnf(c_0_24,hypothesis,
negate(negate(add(X1,negate(negate(X1))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_20]),c_0_19]) ).
cnf(c_0_25,hypothesis,
negate(negate(add(X1,add(X1,X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_23]),c_0_21]) ).
cnf(c_0_26,hypothesis,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_22]),c_0_10]),c_0_25]) ).
cnf(c_0_27,hypothesis,
negate(negate(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_26]),c_0_20]),c_0_21]) ).
cnf(c_0_28,plain,
negate(add(negate(add(X1,X2)),negate(add(negate(X2),X1)))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_29,hypothesis,
add(negate(add(X1,X2)),negate(add(negate(X2),X1))) = negate(X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
prove_huntingtons_axiom ).
cnf(c_0_31,hypothesis,
add(negate(add(X1,X2)),negate(add(negate(X1),X2))) = negate(X2),
inference(spm,[status(thm)],[c_0_29,c_0_9]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ROB004-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 00:46:07 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Ornu1RKSBo/E---3.1_10275.p
% 0.16/0.53 # Version: 3.1pre001
% 0.16/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.53 # Starting sh5l with 300s (1) cores
% 0.16/0.53 # new_bool_1 with pid 10354 completed with status 0
% 0.16/0.53 # Result found by new_bool_1
% 0.16/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.53 # Search class: FUUPS-FFSS21-MFFFFFNN
% 0.16/0.53 # partial match(1): FUUPS-FFSF21-MFFFFFNN
% 0.16/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.53 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.16/0.53 # U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 10359 completed with status 0
% 0.16/0.53 # Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.53 # Search class: FUUPS-FFSS21-MFFFFFNN
% 0.16/0.53 # partial match(1): FUUPS-FFSF21-MFFFFFNN
% 0.16/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.53 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.16/0.53 # Preprocessing time : 0.001 s
% 0.16/0.53 # Presaturation interreduction done
% 0.16/0.53
% 0.16/0.53 # Proof found!
% 0.16/0.53 # SZS status Unsatisfiable
% 0.16/0.53 # SZS output start CNFRefutation
% See solution above
% 0.16/0.53 # Parsed axioms : 7
% 0.16/0.53 # Removed by relevancy pruning/SinE : 0
% 0.16/0.53 # Initial clauses : 7
% 0.16/0.53 # Removed in clause preprocessing : 0
% 0.16/0.53 # Initial clauses in saturation : 7
% 0.16/0.53 # Processed clauses : 1186
% 0.16/0.53 # ...of these trivial : 590
% 0.16/0.53 # ...subsumed : 477
% 0.16/0.53 # ...remaining for further processing : 119
% 0.16/0.53 # Other redundant clauses eliminated : 0
% 0.16/0.53 # Clauses deleted for lack of memory : 0
% 0.16/0.53 # Backward-subsumed : 0
% 0.16/0.53 # Backward-rewritten : 42
% 0.16/0.53 # Generated clauses : 9837
% 0.16/0.53 # ...of the previous two non-redundant : 5088
% 0.16/0.53 # ...aggressively subsumed : 0
% 0.16/0.53 # Contextual simplify-reflections : 0
% 0.16/0.53 # Paramodulations : 9837
% 0.16/0.53 # Factorizations : 0
% 0.16/0.53 # NegExts : 0
% 0.16/0.53 # Equation resolutions : 0
% 0.16/0.53 # Total rewrite steps : 23167
% 0.16/0.53 # Propositional unsat checks : 0
% 0.16/0.53 # Propositional check models : 0
% 0.16/0.53 # Propositional check unsatisfiable : 0
% 0.16/0.53 # Propositional clauses : 0
% 0.16/0.53 # Propositional clauses after purity: 0
% 0.16/0.53 # Propositional unsat core size : 0
% 0.16/0.53 # Propositional preprocessing time : 0.000
% 0.16/0.53 # Propositional encoding time : 0.000
% 0.16/0.53 # Propositional solver time : 0.000
% 0.16/0.53 # Success case prop preproc time : 0.000
% 0.16/0.53 # Success case prop encoding time : 0.000
% 0.16/0.53 # Success case prop solver time : 0.000
% 0.16/0.53 # Current number of processed clauses : 70
% 0.16/0.53 # Positive orientable unit clauses : 66
% 0.16/0.53 # Positive unorientable unit clauses: 4
% 0.16/0.53 # Negative unit clauses : 0
% 0.16/0.53 # Non-unit-clauses : 0
% 0.16/0.53 # Current number of unprocessed clauses: 3699
% 0.16/0.53 # ...number of literals in the above : 3699
% 0.16/0.53 # Current number of archived formulas : 0
% 0.16/0.53 # Current number of archived clauses : 49
% 0.16/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.53 # Non-unit clause-clause subsumptions : 0
% 0.16/0.53 # Unit Clause-clause subsumption calls : 20
% 0.16/0.53 # Rewrite failures with RHS unbound : 0
% 0.16/0.53 # BW rewrite match attempts : 873
% 0.16/0.53 # BW rewrite match successes : 141
% 0.16/0.53 # Condensation attempts : 0
% 0.16/0.53 # Condensation successes : 0
% 0.16/0.53 # Termbank termtop insertions : 116354
% 0.16/0.53
% 0.16/0.53 # -------------------------------------------------
% 0.16/0.53 # User time : 0.081 s
% 0.16/0.53 # System time : 0.001 s
% 0.16/0.53 # Total time : 0.082 s
% 0.16/0.53 # Maximum resident set size: 1620 pages
% 0.16/0.53
% 0.16/0.53 # -------------------------------------------------
% 0.16/0.53 # User time : 0.081 s
% 0.16/0.53 # System time : 0.003 s
% 0.16/0.53 # Total time : 0.085 s
% 0.16/0.53 # Maximum resident set size: 1672 pages
% 0.16/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------