TSTP Solution File: ROB003-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : ROB003-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 5 RR)
% Number of literals : 22 ( 21 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 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 : 28 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(robbins_axiom,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
file('/export/starexec/sandbox/tmp/tmp.uOyp9omVT8/E---3.1_2183.p',robbins_axiom) ).
cnf(there_exists_a_constant,hypothesis,
add(X1,c) = c,
file('/export/starexec/sandbox/tmp/tmp.uOyp9omVT8/E---3.1_2183.p',there_exists_a_constant) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.uOyp9omVT8/E---3.1_2183.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.uOyp9omVT8/E---3.1_2183.p',associativity_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.uOyp9omVT8/E---3.1_2183.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(X1,c) = c,
there_exists_a_constant ).
cnf(c_0_7,hypothesis,
negate(add(negate(c),negate(add(X1,negate(c))))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
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(negate(c),X1)))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,hypothesis,
negate(add(X1,negate(add(negate(c),add(X1,negate(c)))))) = negate(c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_7]),c_0_8]) ).
cnf(c_0_11,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_12,hypothesis,
add(negate(c),negate(c)) = negate(c),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,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_14,hypothesis,
add(negate(c),add(negate(c),X1)) = add(negate(c),X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,hypothesis,
add(negate(c),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_6]),c_0_9]) ).
cnf(c_0_16,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
prove_huntingtons_axiom ).
cnf(c_0_17,hypothesis,
negate(negate(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_15]),c_0_15]) ).
cnf(c_0_18,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_19,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(b),negate(a)))) != b,
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_20,hypothesis,
add(negate(add(X1,X2)),negate(add(X2,negate(X1)))) = negate(X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : ROB003-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Oct 3 00:45:44 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 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.uOyp9omVT8/E---3.1_2183.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_3 with pid 2299 completed with status 0
% 0.20/0.51 # Result found by new_bool_3
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.51 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.20/0.51 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 2310 completed with status 0
% 0.20/0.51 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.51 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 5
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 5
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 5
% 0.20/0.51 # Processed clauses : 781
% 0.20/0.51 # ...of these trivial : 393
% 0.20/0.51 # ...subsumed : 316
% 0.20/0.51 # ...remaining for further processing : 72
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 13
% 0.20/0.51 # Generated clauses : 4815
% 0.20/0.51 # ...of the previous two non-redundant : 2579
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 4815
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Total rewrite steps : 9044
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 54
% 0.20/0.51 # Positive orientable unit clauses : 49
% 0.20/0.51 # Positive unorientable unit clauses: 4
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 0
% 0.20/0.51 # Current number of unprocessed clauses: 1763
% 0.20/0.51 # ...number of literals in the above : 1763
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 18
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 7
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 374
% 0.20/0.51 # BW rewrite match successes : 34
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 49159
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.044 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.046 s
% 0.20/0.51 # Maximum resident set size: 1424 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.046 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.049 s
% 0.20/0.51 # Maximum resident set size: 1668 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------