TSTP Solution File: RNG038-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG038-2 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:58 EDT 2024
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 10 unt; 0 nHn; 9 RR)
% Number of literals : 27 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiplication_is_well_defined,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplication_is_well_defined) ).
cnf(multiplicative_identity1,axiom,
product(additive_identity,X1,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_identity1) ).
cnf(some_property,hypothesis,
( product(X1,h(X1,X2),X2)
| ~ equalish(X1,additive_identity) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',some_property) ).
cnf(multiplicative_identity2,axiom,
product(X1,additive_identity,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_identity2) ).
cnf(a_not_additive_identity,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_not_additive_identity) ).
cnf(c_0_5,plain,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[multiplication_is_well_defined]) ).
cnf(c_0_6,plain,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
c_0_5 ).
cnf(c_0_7,axiom,
product(additive_identity,X1,additive_identity),
multiplicative_identity1 ).
cnf(c_0_8,hypothesis,
( product(X1,h(X1,X2),X2)
| ~ equalish(X1,additive_identity) ),
inference(fof_simplification,[status(thm)],[some_property]) ).
cnf(c_0_9,plain,
( equalish(X1,additive_identity)
| ~ product(additive_identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,axiom,
product(X1,additive_identity,additive_identity),
multiplicative_identity2 ).
cnf(c_0_11,negated_conjecture,
~ equalish(a,additive_identity),
inference(fof_simplification,[status(thm)],[a_not_additive_identity]) ).
cnf(c_0_12,hypothesis,
( product(X1,h(X1,X2),X2)
| ~ equalish(X1,additive_identity) ),
c_0_8 ).
cnf(c_0_13,plain,
equalish(additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ equalish(a,additive_identity),
c_0_11 ).
cnf(c_0_15,hypothesis,
equalish(X1,additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_13])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG038-2 : TPTP v8.2.0. Released v1.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n026.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 : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 12:23:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_3 with pid 11266 completed with status 0
% 0.20/0.50 # Result found by new_bool_3
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FHUNS-FFMF22-SFFFFFNN
% 0.20/0.50 # partial match(2): FHUNS-FFSF22-MFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 181s (1) cores
% 0.20/0.50 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 11269 completed with status 0
% 0.20/0.50 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FHUNS-FFMF22-SFFFFFNN
% 0.20/0.50 # partial match(2): FHUNS-FFSF22-MFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 30
% 0.20/0.50 # Removed by relevancy pruning/SinE : 6
% 0.20/0.50 # Initial clauses : 24
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 24
% 0.20/0.50 # Processed clauses : 46
% 0.20/0.50 # ...of these trivial : 1
% 0.20/0.50 # ...subsumed : 2
% 0.20/0.50 # ...remaining for further processing : 43
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 6
% 0.20/0.50 # Generated clauses : 99
% 0.20/0.50 # ...of the previous two non-redundant : 73
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 99
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 22
% 0.20/0.50 # ...of those cached : 12
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 37
% 0.20/0.50 # Positive orientable unit clauses : 6
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 29
% 0.20/0.50 # Current number of unprocessed clauses: 50
% 0.20/0.50 # ...number of literals in the above : 144
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 6
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 102
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 80
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 4
% 0.20/0.50 # BW rewrite match successes : 4
% 0.20/0.50 # Condensation attempts : 46
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 1891
% 0.20/0.50 # Search garbage collected termcells : 115
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.007 s
% 0.20/0.50 # Maximum resident set size: 1780 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.007 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.010 s
% 0.20/0.50 # Maximum resident set size: 1712 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------