TSTP Solution File: RNG005-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : RNG005-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:14:45 EDT 2024
% Result : Unsatisfiable 1.09s 0.63s
% Output : CNFRefutation 1.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 39 ( 20 unt; 0 nHn; 28 RR)
% Number of literals : 83 ( 0 equ; 47 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 94 ( 2 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.Oii7DyrrDk/E---3.1_29873.p',associativity_of_addition1) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.Oii7DyrrDk/E---3.1_29873.p',additive_identity1) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.Oii7DyrrDk/E---3.1_29873.p',left_inverse) ).
cnf(addition_is_well_defined,axiom,
( equalish(X3,X4)
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.Oii7DyrrDk/E---3.1_29873.p',addition_is_well_defined) ).
cnf(distributivity3,axiom,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ sum(X1,X4,X6)
| ~ product(X6,X2,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.Oii7DyrrDk/E---3.1_29873.p',distributivity3) ).
cnf(product_substitution1,axiom,
( product(X2,X3,X4)
| ~ equalish(X1,X2)
| ~ product(X1,X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.Oii7DyrrDk/E---3.1_29873.p',product_substitution1) ).
cnf(additive_identity2,axiom,
sum(X1,additive_identity,X1),
file('/export/starexec/sandbox2/tmp/tmp.Oii7DyrrDk/E---3.1_29873.p',additive_identity2) ).
cnf(multiplicative_identity1,axiom,
product(additive_identity,X1,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.Oii7DyrrDk/E---3.1_29873.p',multiplicative_identity1) ).
cnf(a_inverse_times_b,hypothesis,
product(additive_inverse(a),b,c),
file('/export/starexec/sandbox2/tmp/tmp.Oii7DyrrDk/E---3.1_29873.p',a_inverse_times_b) ).
cnf(prove_sum_is_additive_identity,negated_conjecture,
~ sum(c,d,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.Oii7DyrrDk/E---3.1_29873.p',prove_sum_is_additive_identity) ).
cnf(a_times_b,hypothesis,
product(a,b,d),
file('/export/starexec/sandbox2/tmp/tmp.Oii7DyrrDk/E---3.1_29873.p',a_times_b) ).
cnf(c_0_11,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_12,plain,
( sum(X1,X5,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X3,X4,X6) ),
c_0_11 ).
cnf(c_0_13,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_14,plain,
( sum(X1,X2,X3)
| ~ sum(X1,X4,additive_identity)
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
sum(additive_inverse(X1),X1,additive_identity),
left_inverse ).
cnf(c_0_16,plain,
( equalish(X3,X4)
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_17,plain,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ sum(X1,X4,X6)
| ~ product(X6,X2,X7) ),
inference(fof_simplification,[status(thm)],[distributivity3]) ).
cnf(c_0_18,plain,
( sum(additive_inverse(X1),X2,X3)
| ~ sum(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( product(X2,X3,X4)
| ~ equalish(X1,X2)
| ~ product(X1,X3,X4) ),
inference(fof_simplification,[status(thm)],[product_substitution1]) ).
cnf(c_0_20,plain,
( equalish(X3,X4)
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
c_0_16 ).
cnf(c_0_21,axiom,
sum(X1,additive_identity,X1),
additive_identity2 ).
cnf(c_0_22,plain,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ sum(X1,X4,X6)
| ~ product(X6,X2,X7) ),
c_0_17 ).
cnf(c_0_23,axiom,
product(additive_identity,X1,additive_identity),
multiplicative_identity1 ).
cnf(c_0_24,plain,
sum(additive_inverse(additive_inverse(X1)),additive_identity,X1),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_25,plain,
( product(X2,X3,X4)
| ~ equalish(X1,X2)
| ~ product(X1,X3,X4) ),
c_0_19 ).
cnf(c_0_26,hypothesis,
product(additive_inverse(a),b,c),
a_inverse_times_b ).
cnf(c_0_27,plain,
( equalish(X1,X2)
| ~ sum(X2,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( sum(X1,X2,additive_identity)
| ~ product(X3,X4,X2)
| ~ product(X5,X4,X1)
| ~ sum(X5,X3,additive_identity) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
sum(additive_inverse(additive_inverse(additive_inverse(X1))),X1,additive_identity),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_30,hypothesis,
( product(X1,b,c)
| ~ equalish(additive_inverse(a),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
equalish(X1,additive_inverse(additive_inverse(X1))),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_32,plain,
( sum(X1,X2,additive_identity)
| ~ product(additive_inverse(additive_inverse(additive_inverse(X3))),X4,X1)
| ~ product(X3,X4,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,hypothesis,
product(additive_inverse(additive_inverse(additive_inverse(a))),b,c),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
~ sum(c,d,additive_identity),
inference(fof_simplification,[status(thm)],[prove_sum_is_additive_identity]) ).
cnf(c_0_35,hypothesis,
( sum(c,X1,additive_identity)
| ~ product(a,b,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,hypothesis,
product(a,b,d),
a_times_b ).
cnf(c_0_37,negated_conjecture,
~ sum(c,d,additive_identity),
c_0_34 ).
cnf(c_0_38,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG005-2 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n002.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 11:47:12 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Oii7DyrrDk/E---3.1_29873.p
% 1.09/0.63 # Version: 3.1.0
% 1.09/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.09/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.09/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.09/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.09/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.09/0.63 # Starting sh5l with 300s (1) cores
% 1.09/0.63 # sh5l with pid 29953 completed with status 0
% 1.09/0.63 # Result found by sh5l
% 1.09/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.09/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.09/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.09/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.09/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.09/0.63 # Starting sh5l with 300s (1) cores
% 1.09/0.63 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.09/0.63 # Search class: FHUNM-FFMF11-SFFFFFNN
% 1.09/0.63 # partial match(1): FHUNM-FFMF21-SFFFFFNN
% 1.09/0.63 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.09/0.63 # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S064A with 163s (1) cores
% 1.09/0.63 # G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S064A with pid 29960 completed with status 0
% 1.09/0.63 # Result found by G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S064A
% 1.09/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.09/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.09/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.09/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.09/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.09/0.63 # Starting sh5l with 300s (1) cores
% 1.09/0.63 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.09/0.63 # Search class: FHUNM-FFMF11-SFFFFFNN
% 1.09/0.63 # partial match(1): FHUNM-FFMF21-SFFFFFNN
% 1.09/0.63 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.09/0.63 # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S064A with 163s (1) cores
% 1.09/0.63 # Preprocessing time : 0.001 s
% 1.09/0.63 # Presaturation interreduction done
% 1.09/0.63
% 1.09/0.63 # Proof found!
% 1.09/0.63 # SZS status Unsatisfiable
% 1.09/0.63 # SZS output start CNFRefutation
% See solution above
% 1.09/0.63 # Parsed axioms : 31
% 1.09/0.63 # Removed by relevancy pruning/SinE : 4
% 1.09/0.63 # Initial clauses : 27
% 1.09/0.63 # Removed in clause preprocessing : 0
% 1.09/0.63 # Initial clauses in saturation : 27
% 1.09/0.63 # Processed clauses : 2408
% 1.09/0.63 # ...of these trivial : 552
% 1.09/0.63 # ...subsumed : 684
% 1.09/0.63 # ...remaining for further processing : 1172
% 1.09/0.63 # Other redundant clauses eliminated : 0
% 1.09/0.63 # Clauses deleted for lack of memory : 0
% 1.09/0.63 # Backward-subsumed : 96
% 1.09/0.63 # Backward-rewritten : 15
% 1.09/0.63 # Generated clauses : 16885
% 1.09/0.63 # ...of the previous two non-redundant : 8745
% 1.09/0.63 # ...aggressively subsumed : 0
% 1.09/0.63 # Contextual simplify-reflections : 0
% 1.09/0.63 # Paramodulations : 16885
% 1.09/0.63 # Factorizations : 0
% 1.09/0.63 # NegExts : 0
% 1.09/0.63 # Equation resolutions : 0
% 1.09/0.63 # Disequality decompositions : 0
% 1.09/0.63 # Total rewrite steps : 8755
% 1.09/0.63 # ...of those cached : 8278
% 1.09/0.63 # Propositional unsat checks : 0
% 1.09/0.63 # Propositional check models : 0
% 1.09/0.63 # Propositional check unsatisfiable : 0
% 1.09/0.63 # Propositional clauses : 0
% 1.09/0.63 # Propositional clauses after purity: 0
% 1.09/0.63 # Propositional unsat core size : 0
% 1.09/0.63 # Propositional preprocessing time : 0.000
% 1.09/0.63 # Propositional encoding time : 0.000
% 1.09/0.63 # Propositional solver time : 0.000
% 1.09/0.63 # Success case prop preproc time : 0.000
% 1.09/0.63 # Success case prop encoding time : 0.000
% 1.09/0.63 # Success case prop solver time : 0.000
% 1.09/0.63 # Current number of processed clauses : 1034
% 1.09/0.63 # Positive orientable unit clauses : 112
% 1.09/0.63 # Positive unorientable unit clauses: 0
% 1.09/0.63 # Negative unit clauses : 1
% 1.09/0.63 # Non-unit-clauses : 921
% 1.09/0.63 # Current number of unprocessed clauses: 6202
% 1.09/0.63 # ...number of literals in the above : 10824
% 1.09/0.63 # Current number of archived formulas : 0
% 1.09/0.63 # Current number of archived clauses : 138
% 1.09/0.63 # Clause-clause subsumption calls (NU) : 102493
% 1.09/0.63 # Rec. Clause-clause subsumption calls : 91570
% 1.09/0.63 # Non-unit clause-clause subsumptions : 780
% 1.09/0.63 # Unit Clause-clause subsumption calls : 52
% 1.09/0.63 # Rewrite failures with RHS unbound : 0
% 1.09/0.63 # BW rewrite match attempts : 862
% 1.09/0.63 # BW rewrite match successes : 15
% 1.09/0.63 # Condensation attempts : 0
% 1.09/0.63 # Condensation successes : 0
% 1.09/0.63 # Termbank termtop insertions : 206112
% 1.09/0.63 # Search garbage collected termcells : 104
% 1.09/0.63
% 1.09/0.63 # -------------------------------------------------
% 1.09/0.63 # User time : 0.130 s
% 1.09/0.63 # System time : 0.002 s
% 1.09/0.63 # Total time : 0.132 s
% 1.09/0.63 # Maximum resident set size: 1768 pages
% 1.09/0.63
% 1.09/0.63 # -------------------------------------------------
% 1.09/0.63 # User time : 0.132 s
% 1.09/0.63 # System time : 0.004 s
% 1.09/0.63 # Total time : 0.136 s
% 1.09/0.63 # Maximum resident set size: 1716 pages
% 1.09/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------