TSTP Solution File: KRS013-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS013-1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 08:12:45 EDT 2024
% Result : Unsatisfiable 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 55 ( 6 unt; 16 nHn; 47 RR)
% Number of literals : 134 ( 0 equ; 69 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 69 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_26,axiom,
( s2least(X1)
| equalish(X2,X3)
| ~ s(X1,X2)
| ~ s(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_26) ).
cnf(clause_31,axiom,
( s1most(X1)
| ~ equalish(u7r2(X1),u7r1(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_31) ).
cnf(clause_32,axiom,
( s1most(X1)
| s(X1,u7r1(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_32) ).
cnf(clause_11,axiom,
( equalish(X1,X2)
| ~ t1most(X3)
| ~ t(X3,X1)
| ~ t(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_11) ).
cnf(clause_6,axiom,
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_6) ).
cnf(clause_16,axiom,
( c(X1)
| ~ e(X2)
| ~ r(X2,X1)
| ~ s2least(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_16) ).
cnf(clause_28,axiom,
( f(X1)
| ~ s1most(u6r1(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_28) ).
cnf(clause_33,axiom,
( s1most(X1)
| s(X1,u7r2(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_33) ).
cnf(clause_15,axiom,
( d(X1)
| ~ e(X2)
| ~ r(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_15) ).
cnf(clause_5,axiom,
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_5) ).
cnf(clause_7,axiom,
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_7) ).
cnf(clause_3,axiom,
( t2least(X1)
| ~ c(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_3) ).
cnf(clause_29,axiom,
( f(X1)
| r(X1,u6r1(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_29) ).
cnf(clause_9,axiom,
( t1most(X1)
| ~ d(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_9) ).
cnf(clause_2,negated_conjecture,
~ f(exist),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_2) ).
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p',clause_1) ).
cnf(c_0_16,plain,
( s2least(X1)
| equalish(X2,X3)
| ~ s(X1,X2)
| ~ s(X1,X3) ),
inference(fof_simplification,[status(thm)],[clause_26]) ).
cnf(c_0_17,plain,
( s1most(X1)
| ~ equalish(u7r2(X1),u7r1(X1)) ),
inference(fof_simplification,[status(thm)],[clause_31]) ).
cnf(c_0_18,plain,
( s2least(X1)
| equalish(X2,X3)
| ~ s(X1,X2)
| ~ s(X1,X3) ),
c_0_16 ).
cnf(c_0_19,axiom,
( s1most(X1)
| s(X1,u7r1(X1)) ),
clause_32 ).
cnf(c_0_20,plain,
( equalish(X1,X2)
| ~ t1most(X3)
| ~ t(X3,X1)
| ~ t(X3,X2) ),
inference(fof_simplification,[status(thm)],[clause_11]) ).
cnf(c_0_21,plain,
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_22,plain,
( c(X1)
| ~ e(X2)
| ~ r(X2,X1)
| ~ s2least(X1) ),
inference(fof_simplification,[status(thm)],[clause_16]) ).
cnf(c_0_23,plain,
( f(X1)
| ~ s1most(u6r1(X1)) ),
inference(fof_simplification,[status(thm)],[clause_28]) ).
cnf(c_0_24,plain,
( s1most(X1)
| ~ equalish(u7r2(X1),u7r1(X1)) ),
c_0_17 ).
cnf(c_0_25,plain,
( s1most(X1)
| s2least(X1)
| equalish(X2,u7r1(X1))
| ~ s(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,axiom,
( s1most(X1)
| s(X1,u7r2(X1)) ),
clause_33 ).
cnf(c_0_27,plain,
( d(X1)
| ~ e(X2)
| ~ r(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause_15]) ).
cnf(c_0_28,plain,
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_29,plain,
( equalish(X1,X2)
| ~ t1most(X3)
| ~ t(X3,X1)
| ~ t(X3,X2) ),
c_0_20 ).
cnf(c_0_30,plain,
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
c_0_21 ).
cnf(c_0_31,plain,
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_32,plain,
( t2least(X1)
| ~ c(X1) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_33,plain,
( c(X1)
| ~ e(X2)
| ~ r(X2,X1)
| ~ s2least(X1) ),
c_0_22 ).
cnf(c_0_34,axiom,
( f(X1)
| r(X1,u6r1(X1)) ),
clause_29 ).
cnf(c_0_35,plain,
( f(X1)
| ~ s1most(u6r1(X1)) ),
c_0_23 ).
cnf(c_0_36,plain,
( s1most(X1)
| s2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_37,plain,
( t1most(X1)
| ~ d(X1) ),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_38,plain,
( d(X1)
| ~ e(X2)
| ~ r(X2,X1) ),
c_0_27 ).
cnf(c_0_39,plain,
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
c_0_28 ).
cnf(c_0_40,plain,
( equalish(X1,u1r1(X2))
| ~ t1most(X2)
| ~ t(X2,X1)
| ~ t2least(X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_41,plain,
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
c_0_31 ).
cnf(c_0_42,plain,
( t2least(X1)
| ~ c(X1) ),
c_0_32 ).
cnf(c_0_43,plain,
( c(u6r1(X1))
| f(X1)
| ~ s2least(u6r1(X1))
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_44,plain,
( s2least(u6r1(X1))
| f(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,plain,
( t1most(X1)
| ~ d(X1) ),
c_0_37 ).
cnf(c_0_46,plain,
( d(u6r1(X1))
| f(X1)
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_34]) ).
cnf(c_0_47,negated_conjecture,
~ f(exist),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_48,plain,
( ~ t1most(X1)
| ~ t2least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_49,plain,
( t2least(u6r1(X1))
| f(X1)
| ~ e(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_50,plain,
( t1most(u6r1(X1))
| f(X1)
| ~ e(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
~ f(exist),
c_0_47 ).
cnf(c_0_52,plain,
( f(X1)
| ~ e(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_53,negated_conjecture,
e(exist),
clause_1 ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KRS013-1 : TPTP v8.1.2. Released v2.0.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri May 3 13:44:11 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.o8B3zETaa9/E---3.1_14464.p
% 0.19/0.48 # Version: 3.1.0
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 14542 completed with status 0
% 0.19/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.48 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.48 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.19/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.48 # G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with pid 14551 completed with status 0
% 0.19/0.48 # Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.48 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.48 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Unsatisfiable
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 33
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 33
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 33
% 0.19/0.48 # Processed clauses : 59
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 4
% 0.19/0.48 # ...remaining for further processing : 55
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 8
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 49
% 0.19/0.48 # ...of the previous two non-redundant : 28
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 6
% 0.19/0.48 # Paramodulations : 49
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 1
% 0.19/0.48 # ...of those cached : 0
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 47
% 0.19/0.48 # Positive orientable unit clauses : 1
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 1
% 0.19/0.48 # Non-unit-clauses : 45
% 0.19/0.48 # Current number of unprocessed clauses: 2
% 0.19/0.48 # ...number of literals in the above : 8
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 8
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 401
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 294
% 0.19/0.48 # Non-unit clause-clause subsumptions : 18
% 0.19/0.48 # Unit Clause-clause subsumption calls : 0
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 0
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 59
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 1694
% 0.19/0.48 # Search garbage collected termcells : 82
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.007 s
% 0.19/0.48 # System time : 0.001 s
% 0.19/0.48 # Total time : 0.008 s
% 0.19/0.48 # Maximum resident set size: 1660 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.027 s
% 0.19/0.48 # System time : 0.007 s
% 0.19/0.48 # Total time : 0.035 s
% 0.19/0.48 # Maximum resident set size: 1712 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------