TSTP Solution File: KRS015-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS015-1 : TPTP v8.2.0. Released v2.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 : Mon May 20 23:15:53 EDT 2024
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 42 ( 5 unt; 0 nHn; 42 RR)
% Number of literals : 96 ( 0 equ; 61 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_10,axiom,
( equalish(X1,X2)
| ~ t1most(X3)
| ~ t(X3,X1)
| ~ t(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_5,axiom,
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_4,axiom,
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_6,axiom,
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_15,axiom,
( s(X1,X2)
| ~ e(X1)
| ~ r(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_2,axiom,
( t2least(X1)
| ~ c(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_17,axiom,
( d(X1)
| ~ e(X2)
| ~ s(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_17) ).
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_8,axiom,
( t1most(X1)
| ~ d(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_14,axiom,
( r(X1,u4r4(X1))
| ~ e(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_14) ).
cnf(clause_18,axiom,
( c(X1)
| ~ e(X2)
| ~ r(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_18) ).
cnf(c_0_11,plain,
( equalish(X1,X2)
| ~ t1most(X3)
| ~ t(X3,X1)
| ~ t(X3,X2) ),
inference(fof_simplification,[status(thm)],[clause_10]) ).
cnf(c_0_12,plain,
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_13,plain,
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_14,plain,
( equalish(X1,X2)
| ~ t1most(X3)
| ~ t(X3,X1)
| ~ t(X3,X2) ),
c_0_11 ).
cnf(c_0_15,plain,
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
c_0_12 ).
cnf(c_0_16,plain,
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_17,plain,
( s(X1,X2)
| ~ e(X1)
| ~ r(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause_15]) ).
cnf(c_0_18,plain,
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
c_0_13 ).
cnf(c_0_19,plain,
( equalish(X1,u1r1(X2))
| ~ t1most(X2)
| ~ t(X2,X1)
| ~ t2least(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
c_0_16 ).
cnf(c_0_21,plain,
( t2least(X1)
| ~ c(X1) ),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_22,plain,
( d(X1)
| ~ e(X2)
| ~ s(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause_17]) ).
cnf(c_0_23,plain,
( s(X1,X2)
| ~ e(X1)
| ~ r(X1,X2) ),
c_0_17 ).
cnf(c_0_24,negated_conjecture,
e(exist),
clause_1 ).
cnf(c_0_25,plain,
( ~ t1most(X1)
| ~ t2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_26,plain,
( t2least(X1)
| ~ c(X1) ),
c_0_21 ).
cnf(c_0_27,plain,
( t1most(X1)
| ~ d(X1) ),
inference(fof_simplification,[status(thm)],[clause_8]) ).
cnf(c_0_28,plain,
( d(X1)
| ~ e(X2)
| ~ s(X2,X1) ),
c_0_22 ).
cnf(c_0_29,negated_conjecture,
( s(exist,X1)
| ~ r(exist,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( r(X1,u4r4(X1))
| ~ e(X1) ),
inference(fof_simplification,[status(thm)],[clause_14]) ).
cnf(c_0_31,plain,
( ~ t1most(X1)
| ~ c(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( t1most(X1)
| ~ d(X1) ),
c_0_27 ).
cnf(c_0_33,negated_conjecture,
( d(X1)
| ~ r(exist,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_24])]) ).
cnf(c_0_34,plain,
( r(X1,u4r4(X1))
| ~ e(X1) ),
c_0_30 ).
cnf(c_0_35,plain,
( c(X1)
| ~ e(X2)
| ~ r(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause_18]) ).
cnf(c_0_36,plain,
( ~ d(X1)
| ~ c(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
d(u4r4(exist)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_24])]) ).
cnf(c_0_38,plain,
( c(X1)
| ~ e(X2)
| ~ r(X2,X1) ),
c_0_35 ).
cnf(c_0_39,negated_conjecture,
~ c(u4r4(exist)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( c(u4r4(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : KRS015-1 : TPTP v8.2.0. Released v2.0.0.
% 0.08/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.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 21:59:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22344 completed with status 0
% 0.20/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.49 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.49 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.20/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.49 # G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with pid 22353 completed with status 0
% 0.20/0.49 # Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.49 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.49 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Unsatisfiable
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 26
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 26
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 26
% 0.20/0.49 # Processed clauses : 41
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 2
% 0.20/0.49 # ...remaining for further processing : 39
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 2
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 33
% 0.20/0.49 # ...of the previous two non-redundant : 19
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 2
% 0.20/0.49 # Paramodulations : 33
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 4
% 0.20/0.49 # ...of those cached : 3
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 37
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 34
% 0.20/0.49 # Current number of unprocessed clauses: 4
% 0.20/0.49 # ...number of literals in the above : 22
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 2
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 473
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 213
% 0.20/0.49 # Non-unit clause-clause subsumptions : 10
% 0.20/0.49 # Unit Clause-clause subsumption calls : 12
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 41
% 0.20/0.49 # Condensation successes : 4
% 0.20/0.49 # Termbank termtop insertions : 1607
% 0.20/0.49 # Search garbage collected termcells : 79
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1656 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.017 s
% 0.20/0.49 # System time : 0.009 s
% 0.20/0.49 # Total time : 0.026 s
% 0.20/0.49 # Maximum resident set size: 1708 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------