TSTP Solution File: RNG002-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG002-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : Tue May 21 02:35:45 EDT 2024
% Result : Unsatisfiable 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 14 unt; 0 nHn; 20 RR)
% Number of literals : 44 ( 7 equ; 23 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 : 41 ( 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/sandbox/benchmark/Axioms/RNG001-0.ax',associativity_of_addition1) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',additive_identity1) ).
cnf(a_plus_c_is_d,hypothesis,
sum(a,c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/Axioms/RNG001-0.ax',addition_is_well_defined) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',left_inverse) ).
cnf(a_plus_b_is_d,hypothesis,
sum(a,b,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_plus_b_is_d) ).
cnf(prove_b_equals_c,negated_conjecture,
b != c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_b_equals_c) ).
cnf(c_0_7,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_8,plain,
( sum(X1,X5,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X3,X4,X6) ),
c_0_7 ).
cnf(c_0_9,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_10,plain,
( sum(X1,X2,X3)
| ~ sum(X1,X4,additive_identity)
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,hypothesis,
sum(a,c,d),
a_plus_c_is_d ).
cnf(c_0_12,plain,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_13,hypothesis,
( sum(X1,d,c)
| ~ sum(X1,a,additive_identity) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
sum(additive_inverse(X1),X1,additive_identity),
left_inverse ).
cnf(c_0_15,hypothesis,
sum(a,b,d),
a_plus_b_is_d ).
cnf(c_0_16,plain,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
c_0_12 ).
cnf(c_0_17,hypothesis,
sum(additive_inverse(a),d,c),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,hypothesis,
( sum(X1,d,b)
| ~ sum(X1,a,additive_identity) ),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
b != c,
inference(fof_simplification,[status(thm)],[prove_b_equals_c]) ).
cnf(c_0_20,hypothesis,
( X1 = c
| ~ sum(additive_inverse(a),d,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,hypothesis,
sum(additive_inverse(a),d,b),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
b != c,
c_0_19 ).
cnf(c_0_23,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG002-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 12:17:37 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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/benchmark/theBenchmark.p
% 0.22/0.51 # Version: 3.1.0
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # sh5l with pid 32117 completed with status 0
% 0.22/0.51 # Result found by sh5l
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.51 # Search class: FHUSM-FFMF11-SFFFFFNN
% 0.22/0.51 # partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.22/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 32124 completed with status 0
% 0.22/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.51 # Search class: FHUSM-FFMF11-SFFFFFNN
% 0.22/0.51 # partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Unsatisfiable
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 20
% 0.22/0.51 # Removed by relevancy pruning/SinE : 2
% 0.22/0.51 # Initial clauses : 18
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 18
% 0.22/0.51 # Processed clauses : 82
% 0.22/0.51 # ...of these trivial : 1
% 0.22/0.51 # ...subsumed : 3
% 0.22/0.51 # ...remaining for further processing : 78
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 0
% 0.22/0.51 # Backward-rewritten : 0
% 0.22/0.51 # Generated clauses : 130
% 0.22/0.51 # ...of the previous two non-redundant : 97
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 130
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 37
% 0.22/0.51 # ...of those cached : 26
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 60
% 0.22/0.51 # Positive orientable unit clauses : 14
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 1
% 0.22/0.51 # Non-unit-clauses : 45
% 0.22/0.51 # Current number of unprocessed clauses: 42
% 0.22/0.51 # ...number of literals in the above : 101
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 18
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 445
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 355
% 0.22/0.51 # Non-unit clause-clause subsumptions : 3
% 0.22/0.51 # Unit Clause-clause subsumption calls : 0
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 2
% 0.22/0.51 # BW rewrite match successes : 0
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 2241
% 0.22/0.51 # Search garbage collected termcells : 67
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.006 s
% 0.22/0.51 # System time : 0.002 s
% 0.22/0.51 # Total time : 0.008 s
% 0.22/0.51 # Maximum resident set size: 1776 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.006 s
% 0.22/0.51 # System time : 0.006 s
% 0.22/0.51 # Total time : 0.012 s
% 0.22/0.51 # Maximum resident set size: 1712 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E exiting
%------------------------------------------------------------------------------