TSTP Solution File: RNG006-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG006-3 : 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:18 EDT 2023
% Result : Unsatisfiable 1.30s 0.64s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 47 ( 29 unt; 0 nHn; 36 RR)
% Number of literals : 82 ( 8 equ; 37 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 83 ( 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.zB16iI65K1/E---3.1_18933.p',associativity_of_addition1) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.zB16iI65K1/E---3.1_18933.p',additive_identity1) ).
cnf(distributivity1,axiom,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ product(X1,X6,X7) ),
file('/export/starexec/sandbox/tmp/tmp.zB16iI65K1/E---3.1_18933.p',distributivity1) ).
cnf(a_times_b,hypothesis,
product(a,b,aPb),
file('/export/starexec/sandbox/tmp/tmp.zB16iI65K1/E---3.1_18933.p',a_times_b) ).
cnf(right_inverse,axiom,
sum(X1,additive_inverse(X1),additive_identity),
file('/export/starexec/sandbox/tmp/tmp.zB16iI65K1/E---3.1_18933.p',right_inverse) ).
cnf(commutativity_of_addition,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.zB16iI65K1/E---3.1_18933.p',commutativity_of_addition) ).
cnf(b_plus_inverse_c,hypothesis,
sum(b,additive_inverse(c),bS_Ic),
file('/export/starexec/sandbox/tmp/tmp.zB16iI65K1/E---3.1_18933.p',b_plus_inverse_c) ).
cnf(a_times_c,hypothesis,
product(a,c,aPc),
file('/export/starexec/sandbox/tmp/tmp.zB16iI65K1/E---3.1_18933.p',a_times_c) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.zB16iI65K1/E---3.1_18933.p',closure_of_addition) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.zB16iI65K1/E---3.1_18933.p',closure_of_multiplication) ).
cnf(addition_is_well_defined,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.zB16iI65K1/E---3.1_18933.p',addition_is_well_defined) ).
cnf(aPb_plus_IaPc,hypothesis,
sum(aPb,additive_inverse(aPc),aPb_S_IaPc),
file('/export/starexec/sandbox/tmp/tmp.zB16iI65K1/E---3.1_18933.p',aPb_plus_IaPc) ).
cnf(additive_identity2,axiom,
sum(X1,additive_identity,X1),
file('/export/starexec/sandbox/tmp/tmp.zB16iI65K1/E---3.1_18933.p',additive_identity2) ).
cnf(prove_a_times_bS_Ic_is_aPb_S__IaPc,negated_conjecture,
~ product(a,bS_Ic,aPb_S_IaPc),
file('/export/starexec/sandbox/tmp/tmp.zB16iI65K1/E---3.1_18933.p',prove_a_times_bS_Ic_is_aPb_S__IaPc) ).
cnf(c_0_14,axiom,
( sum(X1,X5,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X3,X4,X6) ),
associativity_of_addition1 ).
cnf(c_0_15,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_16,axiom,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ product(X1,X6,X7) ),
distributivity1 ).
cnf(c_0_17,hypothesis,
product(a,b,aPb),
a_times_b ).
cnf(c_0_18,plain,
( sum(X1,X2,X3)
| ~ sum(X1,X4,additive_identity)
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
sum(X1,additive_inverse(X1),additive_identity),
right_inverse ).
cnf(c_0_20,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
commutativity_of_addition ).
cnf(c_0_21,hypothesis,
sum(b,additive_inverse(c),bS_Ic),
b_plus_inverse_c ).
cnf(c_0_22,hypothesis,
( sum(X1,X2,aPb)
| ~ product(a,X3,X2)
| ~ product(a,X4,X1)
| ~ sum(X4,X3,b) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,hypothesis,
product(a,c,aPc),
a_times_c ).
cnf(c_0_24,plain,
( sum(X1,X2,X3)
| ~ sum(additive_inverse(X1),X3,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,hypothesis,
sum(additive_inverse(c),b,bS_Ic),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_27,hypothesis,
( sum(X1,aPc,aPb)
| ~ product(a,X2,X1)
| ~ sum(X2,c,b) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_29,hypothesis,
sum(c,bS_Ic,b),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
addition_is_well_defined ).
cnf(c_0_31,hypothesis,
sum(aPb,additive_inverse(aPc),aPb_S_IaPc),
aPb_plus_IaPc ).
cnf(c_0_32,plain,
( sum(X1,X2,add(X3,X4))
| ~ sum(X5,X4,X2)
| ~ sum(X1,X5,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_33,hypothesis,
( sum(multiply(a,X1),aPc,aPb)
| ~ sum(X1,c,b) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,hypothesis,
sum(bS_Ic,c,b),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_35,hypothesis,
( X1 = aPb_S_IaPc
| ~ sum(aPb,additive_inverse(aPc),X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,axiom,
sum(X1,additive_identity,X1),
additive_identity2 ).
cnf(c_0_37,plain,
( sum(X1,additive_identity,add(X2,additive_inverse(X3)))
| ~ sum(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_19]) ).
cnf(c_0_38,hypothesis,
sum(multiply(a,bS_Ic),aPc,aPb),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,hypothesis,
add(aPb,additive_inverse(aPc)) = aPb_S_IaPc,
inference(spm,[status(thm)],[c_0_35,c_0_26]) ).
cnf(c_0_40,plain,
( X1 = X2
| ~ sum(X2,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_36]) ).
cnf(c_0_41,plain,
( X1 = add(X2,X3)
| ~ sum(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_42,hypothesis,
sum(multiply(a,bS_Ic),additive_identity,aPb_S_IaPc),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_43,plain,
add(X1,additive_identity) = X1,
inference(spm,[status(thm)],[c_0_40,c_0_26]) ).
cnf(c_0_44,hypothesis,
multiply(a,bS_Ic) = aPb_S_IaPc,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_45,negated_conjecture,
~ product(a,bS_Ic,aPb_S_IaPc),
prove_a_times_bS_Ic_is_aPb_S__IaPc ).
cnf(c_0_46,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG006-3 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 19:16:56 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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.zB16iI65K1/E---3.1_18933.p
% 1.30/0.64 # Version: 3.1pre001
% 1.30/0.64 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.30/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.30/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.30/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.30/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.30/0.64 # Starting sh5l with 300s (1) cores
% 1.30/0.64 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 19011 completed with status 0
% 1.30/0.64 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.30/0.64 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.30/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.30/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.30/0.64 # No SInE strategy applied
% 1.30/0.64 # Search class: FHUSM-FFMS21-SFFFFFNN
% 1.30/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.30/0.64 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 1.30/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.30/0.64 # Starting new_bool_3 with 136s (1) cores
% 1.30/0.64 # Starting new_bool_1 with 136s (1) cores
% 1.30/0.64 # Starting sh5l with 136s (1) cores
% 1.30/0.64 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 19019 completed with status 0
% 1.30/0.64 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.30/0.64 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.30/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.30/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.30/0.64 # No SInE strategy applied
% 1.30/0.64 # Search class: FHUSM-FFMS21-SFFFFFNN
% 1.30/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.30/0.64 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 1.30/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.30/0.64 # Preprocessing time : 0.001 s
% 1.30/0.64 # Presaturation interreduction done
% 1.30/0.64
% 1.30/0.64 # Proof found!
% 1.30/0.64 # SZS status Unsatisfiable
% 1.30/0.64 # SZS output start CNFRefutation
% See solution above
% 1.30/0.64 # Parsed axioms : 22
% 1.30/0.64 # Removed by relevancy pruning/SinE : 0
% 1.30/0.64 # Initial clauses : 22
% 1.30/0.64 # Removed in clause preprocessing : 0
% 1.30/0.64 # Initial clauses in saturation : 22
% 1.30/0.64 # Processed clauses : 1796
% 1.30/0.64 # ...of these trivial : 177
% 1.30/0.64 # ...subsumed : 614
% 1.30/0.64 # ...remaining for further processing : 1005
% 1.30/0.64 # Other redundant clauses eliminated : 0
% 1.30/0.64 # Clauses deleted for lack of memory : 0
% 1.30/0.64 # Backward-subsumed : 35
% 1.30/0.64 # Backward-rewritten : 82
% 1.30/0.64 # Generated clauses : 7184
% 1.30/0.64 # ...of the previous two non-redundant : 4796
% 1.30/0.64 # ...aggressively subsumed : 0
% 1.30/0.64 # Contextual simplify-reflections : 0
% 1.30/0.64 # Paramodulations : 7184
% 1.30/0.64 # Factorizations : 0
% 1.30/0.64 # NegExts : 0
% 1.30/0.64 # Equation resolutions : 0
% 1.30/0.64 # Total rewrite steps : 5133
% 1.30/0.64 # Propositional unsat checks : 0
% 1.30/0.64 # Propositional check models : 0
% 1.30/0.64 # Propositional check unsatisfiable : 0
% 1.30/0.64 # Propositional clauses : 0
% 1.30/0.64 # Propositional clauses after purity: 0
% 1.30/0.64 # Propositional unsat core size : 0
% 1.30/0.64 # Propositional preprocessing time : 0.000
% 1.30/0.64 # Propositional encoding time : 0.000
% 1.30/0.64 # Propositional solver time : 0.000
% 1.30/0.64 # Success case prop preproc time : 0.000
% 1.30/0.64 # Success case prop encoding time : 0.000
% 1.30/0.64 # Success case prop solver time : 0.000
% 1.30/0.64 # Current number of processed clauses : 866
% 1.30/0.64 # Positive orientable unit clauses : 155
% 1.30/0.64 # Positive unorientable unit clauses: 1
% 1.30/0.64 # Negative unit clauses : 2
% 1.30/0.64 # Non-unit-clauses : 708
% 1.30/0.64 # Current number of unprocessed clauses: 2798
% 1.30/0.64 # ...number of literals in the above : 5918
% 1.30/0.64 # Current number of archived formulas : 0
% 1.30/0.64 # Current number of archived clauses : 139
% 1.30/0.64 # Clause-clause subsumption calls (NU) : 60250
% 1.30/0.64 # Rec. Clause-clause subsumption calls : 48924
% 1.30/0.64 # Non-unit clause-clause subsumptions : 642
% 1.30/0.64 # Unit Clause-clause subsumption calls : 752
% 1.30/0.64 # Rewrite failures with RHS unbound : 0
% 1.30/0.64 # BW rewrite match attempts : 319
% 1.30/0.64 # BW rewrite match successes : 69
% 1.30/0.64 # Condensation attempts : 0
% 1.30/0.64 # Condensation successes : 0
% 1.30/0.64 # Termbank termtop insertions : 87209
% 1.30/0.64
% 1.30/0.64 # -------------------------------------------------
% 1.30/0.64 # User time : 0.124 s
% 1.30/0.64 # System time : 0.007 s
% 1.30/0.64 # Total time : 0.131 s
% 1.30/0.64 # Maximum resident set size: 1652 pages
% 1.30/0.64
% 1.30/0.64 # -------------------------------------------------
% 1.30/0.64 # User time : 0.641 s
% 1.30/0.64 # System time : 0.013 s
% 1.30/0.64 # Total time : 0.654 s
% 1.30/0.64 # Maximum resident set size: 1684 pages
% 1.30/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------