TSTP Solution File: ROB021-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : ROB021-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:21 EDT 2023
% Result : Timeout 0.30s 300.10s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 10 unt; 0 nHn; 6 RR)
% Number of literals : 14 ( 13 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 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.WWMJrJpK0b/E---3.1_2048.p',robbins_axiom) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.WWMJrJpK0b/E---3.1_2048.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.WWMJrJpK0b/E---3.1_2048.p',prove_huntingtons_axiom) ).
cnf(negative_equality_implies_positive_equality,hypothesis,
( X1 = X2
| negate(X1) != negate(X2) ),
file('/export/starexec/sandbox/tmp/tmp.WWMJrJpK0b/E---3.1_2048.p',negative_equality_implies_positive_equality) ).
cnf(c_0_4,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
robbins_axiom ).
cnf(c_0_5,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_6,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
prove_huntingtons_axiom ).
cnf(c_0_7,hypothesis,
( X1 = X2
| negate(X1) != negate(X2) ),
negative_equality_implies_positive_equality ).
cnf(c_0_8,plain,
negate(add(negate(add(X1,X2)),negate(add(X2,negate(X1))))) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_9,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(b),negate(a)))) != b,
inference(rw,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_10,hypothesis,
add(negate(add(X1,negate(X2))),negate(add(negate(X2),negate(X1)))) = X2,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ROB021-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n020.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:28:46 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.WWMJrJpK0b/E---3.1_2048.p
% 0.30/300.10 # Version: 3.1pre001
% 0.30/300.10 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.30/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/300.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.30/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.30/300.10 # Starting new_bool_1 with 300s (1) cores
% 0.30/300.10 # Starting sh5l with 300s (1) cores
% 0.30/300.10 # new_bool_3 with pid 2141 completed with status 0
% 0.30/300.10 # Result found by new_bool_3
% 0.30/300.10 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.30/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/300.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.30/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.30/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/300.10 # Search class: FHUPS-FFSF21-MFFFFFNN
% 0.30/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/300.10 # Starting U----_211g_01_C07_19_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.30/300.10 # U----_211g_01_C07_19_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 2145 completed with status 0
% 0.30/300.10 # Result found by U----_211g_01_C07_19_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.30/300.10 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.30/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/300.10 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.30/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.30/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/300.10 # Search class: FHUPS-FFSF21-MFFFFFNN
% 0.30/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/300.10 # Starting U----_211g_01_C07_19_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.30/300.10 # Preprocessing time : 0.001 s
% 0.30/300.10 # Presaturation interreduction done
% 0.30/300.10
% 0.30/300.10 # Proof found!
% 0.30/300.10 # SZS status Unsatisfiable
% 0.30/300.10 # SZS output start CNFRefutation
% See solution above
% 0.30/300.10 # Parsed axioms : 5
% 0.30/300.10 # Removed by relevancy pruning/SinE : 0
% 0.30/300.10 # Initial clauses : 5
% 0.30/300.10 # Removed in clause preprocessing : 0
% 0.30/300.10 # Initial clauses in saturation : 5
% 0.30/300.10 # Processed clauses : 31
% 0.30/300.10 # ...of these trivial : 7
% 0.30/300.10 # ...subsumed : 6
% 0.30/300.10 # ...remaining for further processing : 18
% 0.30/300.10 # Other redundant clauses eliminated : 8
% 0.30/300.10 # Clauses deleted for lack of memory : 0
% 0.30/300.10 # Backward-subsumed : 0
% 0.30/300.10 # Backward-rewritten : 1
% 0.30/300.10 # Generated clauses : 303
% 0.30/300.10 # ...of the previous two non-redundant : 233
% 0.30/300.10 # ...aggressively subsumed : 0
% 0.30/300.10 # Contextual simplify-reflections : 0
% 0.30/300.10 # Paramodulations : 294
% 0.30/300.10 # Factorizations : 0
% 0.30/300.10 # NegExts : 0
% 0.30/300.10 # Equation resolutions : 9
% 0.30/300.10 # Total rewrite steps : 88
% 0.30/300.10 # Propositional unsat checks : 0
% 0.30/300.10 # Propositional check models : 0
% 0.30/300.10 # Propositional check unsatisfiable : 0
% 0.30/300.10 # Propositional clauses : 0
% 0.30/300.10 # Propositional clauses after purity: 0
% 0.30/300.10 # Propositional unsat core size : 0
% 0.30/300.10 # Propositional preprocessing time : 0.000
% 0.30/300.10 # Propositional encoding time : 0.000
% 0.30/300.10 # Propositional solver time : 0.000
% 0.30/300.10 # Success case prop preproc time : 0.000
% 0.30/300.10 # Success case prop encoding time : 0.000
% 0.30/300.10 # Success case prop solver time : 0.000
% 0.30/300.10 # Current number of processed clauses : 12
% 0.30/300.10 # Positive orientable unit clauses : 8
% 0.30/300.10 # Positive unorientable unit clauses: 3
% 0.30/300.10 # Negative unit clauses : 0
% 0.30/300.10 # Non-unit-clauses : 1
% 0.30/300.10 # Current number of unprocessed clauses: 212
% 0.30/300.10 # ...number of literals in the above : 212
% 0.30/300.10 # Current number of archived formulas : 0
% 0.30/300.10 # Current number of archived clauses : 6
% 0.30/300.10 # Clause-clause subsumption calls (NU) : 0
% 0.30/300.10 # Rec. Clause-clause subsumption calls : 0
% 0.30/300.10 # Non-unit clause-clause subsumptions : 0
% 0.30/300.10 # Unit Clause-clause subsumption calls : 4
% 0.30/300.10 # Rewrite failures with RHS unbound : 0
% 0.30/300.10 # BW rewrite match attempts : 45
% 0.30/300.10 # BW rewrite match successes : 17
% 0.30/300.10 # Condensation attempts : 0
% 0.30/300.10 # Condensation successes : 0
% 0.30/300.10 # Termbank termtop insertions : 3429
% 0.30/300.10
% 0.30/300.10 # -------------------------------------------------
% 0.30/300.10 # User time : 0.004 s
% 0.30/300.10 # System time : 0.002 s
% 0.30/300.10 # Total time : 0.006 s
% 0.30/300.10 # Maximum resident set size: 1624 pages
% 0.30/300.10
% 0.30/300.10 # -------------------------------------------------
% 0.30/300.10 # User time : 0.004 s
% 0.30/300.10 # System time : 0.004 s
% 0.30/300.10 # Total time : 0.008 s
% 0.30/300.10 # Maximum resident set size: 1672 pages
% 0.30/300.10 % E---3.1 exiting
%------------------------------------------------------------------------------