TSTP Solution File: RNG006-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG006-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:46 EDT 2024
% Result : Unsatisfiable 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 13 unt; 0 nHn; 21 RR)
% Number of literals : 41 ( 0 equ; 23 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity2,axiom,
( product(X1,X6,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ sum(X3,X5,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',distributivity2) ).
cnf(aPb_plus_IaPc,hypothesis,
sum(aPb,additive_inverse(aPc),aPb_S_IaPc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aPb_plus_IaPc) ).
cnf(product_lemma1,axiom,
( product(X1,additive_inverse(X2),additive_inverse(X3))
| ~ product(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_lemma1) ).
cnf(a_times_b,hypothesis,
product(a,b,aPb),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b) ).
cnf(a_times_c,hypothesis,
product(a,c,aPc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_c) ).
cnf(prove_a_times_bS_Ic_is_aPb_S__IaPc,negated_conjecture,
~ product(a,bS_Ic,aPb_S_IaPc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_times_bS_Ic_is_aPb_S__IaPc) ).
cnf(b_plus_inverse_c,hypothesis,
sum(b,additive_inverse(c),bS_Ic),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_plus_inverse_c) ).
cnf(c_0_7,plain,
( product(X1,X6,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ sum(X3,X5,X7) ),
inference(fof_simplification,[status(thm)],[distributivity2]) ).
cnf(c_0_8,plain,
( product(X1,X6,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ sum(X3,X5,X7) ),
c_0_7 ).
cnf(c_0_9,hypothesis,
sum(aPb,additive_inverse(aPc),aPb_S_IaPc),
aPb_plus_IaPc ).
cnf(c_0_10,plain,
( product(X1,additive_inverse(X2),additive_inverse(X3))
| ~ product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[product_lemma1]) ).
cnf(c_0_11,hypothesis,
( product(X1,X2,aPb_S_IaPc)
| ~ product(X1,X3,additive_inverse(aPc))
| ~ product(X1,X4,aPb)
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,hypothesis,
product(a,b,aPb),
a_times_b ).
cnf(c_0_13,plain,
( product(X1,additive_inverse(X2),additive_inverse(X3))
| ~ product(X1,X2,X3) ),
c_0_10 ).
cnf(c_0_14,hypothesis,
product(a,c,aPc),
a_times_c ).
cnf(c_0_15,negated_conjecture,
~ product(a,bS_Ic,aPb_S_IaPc),
inference(fof_simplification,[status(thm)],[prove_a_times_bS_Ic_is_aPb_S__IaPc]) ).
cnf(c_0_16,hypothesis,
( product(a,X1,aPb_S_IaPc)
| ~ product(a,X2,additive_inverse(aPc))
| ~ sum(b,X2,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,hypothesis,
sum(b,additive_inverse(c),bS_Ic),
b_plus_inverse_c ).
cnf(c_0_18,hypothesis,
product(a,additive_inverse(c),additive_inverse(aPc)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ product(a,bS_Ic,aPb_S_IaPc),
c_0_15 ).
cnf(c_0_20,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG006-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 12:00:07 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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/benchmark/theBenchmark.p
% 0.19/0.50 # Version: 3.1.0
% 0.19/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 5210 completed with status 0
% 0.19/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.19/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FHUSM-FFMS21-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.19/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.50 # Starting sh5l with 136s (1) cores
% 0.19/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 5215 completed with status 0
% 0.19/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.19/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FHUSM-FFMS21-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Unsatisfiable
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 25
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 25
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 25
% 0.19/0.50 # Processed clauses : 212
% 0.19/0.50 # ...of these trivial : 20
% 0.19/0.50 # ...subsumed : 20
% 0.19/0.50 # ...remaining for further processing : 172
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 11
% 0.19/0.50 # Generated clauses : 598
% 0.19/0.50 # ...of the previous two non-redundant : 438
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 598
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 312
% 0.19/0.50 # ...of those cached : 218
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 136
% 0.19/0.50 # Positive orientable unit clauses : 44
% 0.19/0.50 # Positive unorientable unit clauses: 1
% 0.19/0.50 # Negative unit clauses : 1
% 0.19/0.50 # Non-unit-clauses : 90
% 0.19/0.50 # Current number of unprocessed clauses: 272
% 0.19/0.50 # ...number of literals in the above : 625
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 36
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 1154
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 895
% 0.19/0.50 # Non-unit clause-clause subsumptions : 19
% 0.19/0.50 # Unit Clause-clause subsumption calls : 96
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 110
% 0.19/0.50 # BW rewrite match successes : 30
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 7554
% 0.19/0.50 # Search garbage collected termcells : 64
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.018 s
% 0.19/0.50 # System time : 0.000 s
% 0.19/0.50 # Total time : 0.018 s
% 0.19/0.50 # Maximum resident set size: 1648 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.053 s
% 0.19/0.50 # System time : 0.006 s
% 0.19/0.50 # Total time : 0.059 s
% 0.19/0.50 # Maximum resident set size: 1716 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------