TSTP Solution File: RNG003-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG003-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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:13:59 EDT 2024
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 16 unt; 0 nHn; 25 RR)
% Number of literals : 52 ( 7 equ; 26 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_addition1,axiom,
( sum(X1,X5,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X3,X4,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.cGVde0Ppx3/E---3.1_20482.p',associativity_of_addition1) ).
cnf(commutativity_of_addition,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.cGVde0Ppx3/E---3.1_20482.p',commutativity_of_addition) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.cGVde0Ppx3/E---3.1_20482.p',additive_identity1) ).
cnf(b_plus_c_is_d,hypothesis,
sum(b,c,d),
file('/export/starexec/sandbox2/tmp/tmp.cGVde0Ppx3/E---3.1_20482.p',b_plus_c_is_d) ).
cnf(a_plus_c_is_d,hypothesis,
sum(a,c,d),
file('/export/starexec/sandbox2/tmp/tmp.cGVde0Ppx3/E---3.1_20482.p',a_plus_c_is_d) ).
cnf(addition_is_well_defined,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.cGVde0Ppx3/E---3.1_20482.p',addition_is_well_defined) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.cGVde0Ppx3/E---3.1_20482.p',left_inverse) ).
cnf(prove_a_equals_b,negated_conjecture,
a != b,
file('/export/starexec/sandbox2/tmp/tmp.cGVde0Ppx3/E---3.1_20482.p',prove_a_equals_b) ).
cnf(c_0_8,plain,
( sum(X1,X5,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_addition1]) ).
cnf(c_0_9,plain,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_addition]) ).
cnf(c_0_10,plain,
( sum(X1,X5,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X3,X4,X6) ),
c_0_8 ).
cnf(c_0_11,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_12,plain,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
c_0_9 ).
cnf(c_0_13,hypothesis,
sum(b,c,d),
b_plus_c_is_d ).
cnf(c_0_14,plain,
( sum(X1,X2,X3)
| ~ sum(X1,X4,additive_identity)
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,hypothesis,
sum(c,b,d),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,hypothesis,
sum(a,c,d),
a_plus_c_is_d ).
cnf(c_0_17,plain,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_18,hypothesis,
( sum(X1,d,b)
| ~ sum(X1,c,additive_identity) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
sum(additive_inverse(X1),X1,additive_identity),
left_inverse ).
cnf(c_0_20,hypothesis,
sum(c,a,d),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_21,plain,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
c_0_17 ).
cnf(c_0_22,hypothesis,
sum(additive_inverse(c),d,b),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,hypothesis,
( sum(X1,d,a)
| ~ sum(X1,c,additive_identity) ),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[prove_a_equals_b]) ).
cnf(c_0_25,hypothesis,
( X1 = b
| ~ sum(additive_inverse(c),d,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,hypothesis,
sum(additive_inverse(c),d,a),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
a != b,
c_0_24 ).
cnf(c_0_28,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : RNG003-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n029.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 : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 11:44:52 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.cGVde0Ppx3/E---3.1_20482.p
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # sh5l with pid 20588 completed with status 0
% 0.21/0.52 # Result found by sh5l
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FHUSM-FFMF11-SFFFFFNN
% 0.21/0.52 # partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.21/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 20596 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FHUSM-FFMF11-SFFFFFNN
% 0.21/0.52 # partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 20
% 0.21/0.52 # Removed by relevancy pruning/SinE : 2
% 0.21/0.52 # Initial clauses : 18
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 18
% 0.21/0.52 # Processed clauses : 82
% 0.21/0.52 # ...of these trivial : 1
% 0.21/0.52 # ...subsumed : 3
% 0.21/0.52 # ...remaining for further processing : 78
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 130
% 0.21/0.52 # ...of the previous two non-redundant : 97
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 130
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 37
% 0.21/0.52 # ...of those cached : 26
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 60
% 0.21/0.52 # Positive orientable unit clauses : 14
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 1
% 0.21/0.52 # Non-unit-clauses : 45
% 0.21/0.52 # Current number of unprocessed clauses: 42
% 0.21/0.52 # ...number of literals in the above : 101
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 18
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 439
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 349
% 0.21/0.52 # Non-unit clause-clause subsumptions : 3
% 0.21/0.52 # Unit Clause-clause subsumption calls : 0
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 2
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 2241
% 0.21/0.52 # Search garbage collected termcells : 67
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.007 s
% 0.21/0.52 # System time : 0.002 s
% 0.21/0.52 # Total time : 0.009 s
% 0.21/0.52 # Maximum resident set size: 1760 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.008 s
% 0.21/0.52 # System time : 0.004 s
% 0.21/0.52 # Total time : 0.012 s
% 0.21/0.52 # Maximum resident set size: 1700 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------