TSTP Solution File: RNG003-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG003-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:15:16 EDT 2023
% Result : Unsatisfiable 0.71s 0.93s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 15 unt; 0 nHn; 21 RR)
% Number of literals : 42 ( 5 equ; 19 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 : 37 ( 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/tmp/tmp.mhDkEefDIa/E---3.1_8709.p',associativity_of_addition1) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.mhDkEefDIa/E---3.1_8709.p',additive_identity1) ).
cnf(commutativity_of_addition,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.mhDkEefDIa/E---3.1_8709.p',commutativity_of_addition) ).
cnf(b_plus_c_is_d,hypothesis,
sum(b,c,d),
file('/export/starexec/sandbox/tmp/tmp.mhDkEefDIa/E---3.1_8709.p',b_plus_c_is_d) ).
cnf(a_plus_c_is_d,hypothesis,
sum(a,c,d),
file('/export/starexec/sandbox/tmp/tmp.mhDkEefDIa/E---3.1_8709.p',a_plus_c_is_d) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.mhDkEefDIa/E---3.1_8709.p',left_inverse) ).
cnf(addition_is_well_defined,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.mhDkEefDIa/E---3.1_8709.p',addition_is_well_defined) ).
cnf(prove_a_equals_b,negated_conjecture,
a != b,
file('/export/starexec/sandbox/tmp/tmp.mhDkEefDIa/E---3.1_8709.p',prove_a_equals_b) ).
cnf(c_0_8,axiom,
( sum(X1,X5,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X3,X4,X6) ),
associativity_of_addition1 ).
cnf(c_0_9,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_10,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
commutativity_of_addition ).
cnf(c_0_11,hypothesis,
sum(b,c,d),
b_plus_c_is_d ).
cnf(c_0_12,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_13,hypothesis,
sum(c,b,d),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,hypothesis,
sum(a,c,d),
a_plus_c_is_d ).
cnf(c_0_15,hypothesis,
( sum(X1,d,b)
| ~ sum(X1,c,additive_identity) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
sum(additive_inverse(X1),X1,additive_identity),
left_inverse ).
cnf(c_0_17,hypothesis,
sum(c,a,d),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_18,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
addition_is_well_defined ).
cnf(c_0_19,hypothesis,
sum(additive_inverse(c),d,b),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,hypothesis,
( sum(X1,d,a)
| ~ sum(X1,c,additive_identity) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_21,hypothesis,
( X1 = b
| ~ sum(additive_inverse(c),d,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,hypothesis,
sum(additive_inverse(c),d,a),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
a != b,
prove_a_equals_b ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : RNG003-1 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n017.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 19:08:41 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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.mhDkEefDIa/E---3.1_8709.p
% 0.71/0.93 # Version: 3.1pre001
% 0.71/0.93 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.71/0.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.93 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.71/0.93 # Starting new_bool_3 with 300s (1) cores
% 0.71/0.93 # Starting new_bool_1 with 300s (1) cores
% 0.71/0.93 # Starting sh5l with 300s (1) cores
% 0.71/0.93 # sh5l with pid 8789 completed with status 0
% 0.71/0.93 # Result found by sh5l
% 0.71/0.93 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.71/0.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.93 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.71/0.93 # Starting new_bool_3 with 300s (1) cores
% 0.71/0.93 # Starting new_bool_1 with 300s (1) cores
% 0.71/0.93 # Starting sh5l with 300s (1) cores
% 0.71/0.93 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.71/0.93 # Search class: FHUSM-FFMF11-SFFFFFNN
% 0.71/0.93 # partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.71/0.93 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.71/0.93 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.71/0.93 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 8796 completed with status 0
% 0.71/0.93 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.71/0.93 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.71/0.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.93 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.71/0.93 # Starting new_bool_3 with 300s (1) cores
% 0.71/0.93 # Starting new_bool_1 with 300s (1) cores
% 0.71/0.93 # Starting sh5l with 300s (1) cores
% 0.71/0.93 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.71/0.93 # Search class: FHUSM-FFMF11-SFFFFFNN
% 0.71/0.93 # partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.71/0.93 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.71/0.93 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.71/0.93 # Preprocessing time : 0.001 s
% 0.71/0.93 # Presaturation interreduction done
% 0.71/0.93
% 0.71/0.93 # Proof found!
% 0.71/0.93 # SZS status Unsatisfiable
% 0.71/0.93 # SZS output start CNFRefutation
% See solution above
% 0.71/0.93 # Parsed axioms : 20
% 0.71/0.93 # Removed by relevancy pruning/SinE : 2
% 0.71/0.93 # Initial clauses : 18
% 0.71/0.93 # Removed in clause preprocessing : 0
% 0.71/0.93 # Initial clauses in saturation : 18
% 0.71/0.93 # Processed clauses : 82
% 0.71/0.93 # ...of these trivial : 1
% 0.71/0.93 # ...subsumed : 3
% 0.71/0.93 # ...remaining for further processing : 78
% 0.71/0.93 # Other redundant clauses eliminated : 0
% 0.71/0.93 # Clauses deleted for lack of memory : 0
% 0.71/0.93 # Backward-subsumed : 0
% 0.71/0.93 # Backward-rewritten : 0
% 0.71/0.93 # Generated clauses : 130
% 0.71/0.93 # ...of the previous two non-redundant : 97
% 0.71/0.93 # ...aggressively subsumed : 0
% 0.71/0.93 # Contextual simplify-reflections : 0
% 0.71/0.93 # Paramodulations : 130
% 0.71/0.93 # Factorizations : 0
% 0.71/0.93 # NegExts : 0
% 0.71/0.93 # Equation resolutions : 0
% 0.71/0.93 # Total rewrite steps : 37
% 0.71/0.93 # Propositional unsat checks : 0
% 0.71/0.93 # Propositional check models : 0
% 0.71/0.93 # Propositional check unsatisfiable : 0
% 0.71/0.93 # Propositional clauses : 0
% 0.71/0.93 # Propositional clauses after purity: 0
% 0.71/0.93 # Propositional unsat core size : 0
% 0.71/0.93 # Propositional preprocessing time : 0.000
% 0.71/0.93 # Propositional encoding time : 0.000
% 0.71/0.93 # Propositional solver time : 0.000
% 0.71/0.93 # Success case prop preproc time : 0.000
% 0.71/0.93 # Success case prop encoding time : 0.000
% 0.71/0.93 # Success case prop solver time : 0.000
% 0.71/0.93 # Current number of processed clauses : 60
% 0.71/0.93 # Positive orientable unit clauses : 14
% 0.71/0.93 # Positive unorientable unit clauses: 0
% 0.71/0.93 # Negative unit clauses : 1
% 0.71/0.93 # Non-unit-clauses : 45
% 0.71/0.93 # Current number of unprocessed clauses: 42
% 0.71/0.93 # ...number of literals in the above : 101
% 0.71/0.93 # Current number of archived formulas : 0
% 0.71/0.93 # Current number of archived clauses : 18
% 0.71/0.93 # Clause-clause subsumption calls (NU) : 439
% 0.71/0.93 # Rec. Clause-clause subsumption calls : 349
% 0.71/0.93 # Non-unit clause-clause subsumptions : 3
% 0.71/0.93 # Unit Clause-clause subsumption calls : 0
% 0.71/0.93 # Rewrite failures with RHS unbound : 0
% 0.71/0.93 # BW rewrite match attempts : 2
% 0.71/0.93 # BW rewrite match successes : 0
% 0.71/0.93 # Condensation attempts : 0
% 0.71/0.93 # Condensation successes : 0
% 0.71/0.93 # Termbank termtop insertions : 2073
% 0.71/0.93
% 0.71/0.93 # -------------------------------------------------
% 0.71/0.93 # User time : 0.004 s
% 0.71/0.93 # System time : 0.002 s
% 0.71/0.93 # Total time : 0.006 s
% 0.71/0.93 # Maximum resident set size: 1644 pages
% 0.71/0.93
% 0.71/0.93 # -------------------------------------------------
% 0.71/0.93 # User time : 0.005 s
% 0.71/0.93 # System time : 0.004 s
% 0.71/0.93 # Total time : 0.009 s
% 0.71/0.93 # Maximum resident set size: 1688 pages
% 0.71/0.93 % E---3.1 exiting
%------------------------------------------------------------------------------