TSTP Solution File: KRS003-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS003-1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:43 EDT 2024
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 9 unt; 0 nHn; 35 RR)
% Number of literals : 69 ( 0 equ; 38 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_11,axiom,
( equalish(X1,X2)
| ~ s1most(X3)
| ~ s(X3,X1)
| ~ s(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.98nqYEPIkL/E---3.1_13605.p',clause_11) ).
cnf(clause_6,axiom,
( s(X1,u1r1(X1))
| ~ s2least(X1) ),
file('/export/starexec/sandbox/tmp/tmp.98nqYEPIkL/E---3.1_13605.p',clause_6) ).
cnf(clause_15,axiom,
( c(X1)
| ~ e(X1) ),
file('/export/starexec/sandbox/tmp/tmp.98nqYEPIkL/E---3.1_13605.p',clause_15) ).
cnf(clause_16,axiom,
( d(X1)
| ~ f(X1) ),
file('/export/starexec/sandbox/tmp/tmp.98nqYEPIkL/E---3.1_13605.p',clause_16) ).
cnf(clause_5,axiom,
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.98nqYEPIkL/E---3.1_13605.p',clause_5) ).
cnf(clause_7,axiom,
( s(X1,u1r2(X1))
| ~ s2least(X1) ),
file('/export/starexec/sandbox/tmp/tmp.98nqYEPIkL/E---3.1_13605.p',clause_7) ).
cnf(clause_3,axiom,
( s2least(X1)
| ~ c(X1) ),
file('/export/starexec/sandbox/tmp/tmp.98nqYEPIkL/E---3.1_13605.p',clause_3) ).
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox/tmp/tmp.98nqYEPIkL/E---3.1_13605.p',clause_1) ).
cnf(clause_9,axiom,
( s1most(X1)
| ~ d(X1) ),
file('/export/starexec/sandbox/tmp/tmp.98nqYEPIkL/E---3.1_13605.p',clause_9) ).
cnf(clause_2,negated_conjecture,
f(exist),
file('/export/starexec/sandbox/tmp/tmp.98nqYEPIkL/E---3.1_13605.p',clause_2) ).
cnf(c_0_10,plain,
( equalish(X1,X2)
| ~ s1most(X3)
| ~ s(X3,X1)
| ~ s(X3,X2) ),
inference(fof_simplification,[status(thm)],[clause_11]) ).
cnf(c_0_11,plain,
( s(X1,u1r1(X1))
| ~ s2least(X1) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_12,plain,
( c(X1)
| ~ e(X1) ),
inference(fof_simplification,[status(thm)],[clause_15]) ).
cnf(c_0_13,plain,
( d(X1)
| ~ f(X1) ),
inference(fof_simplification,[status(thm)],[clause_16]) ).
cnf(c_0_14,plain,
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_15,plain,
( equalish(X1,X2)
| ~ s1most(X3)
| ~ s(X3,X1)
| ~ s(X3,X2) ),
c_0_10 ).
cnf(c_0_16,plain,
( s(X1,u1r1(X1))
| ~ s2least(X1) ),
c_0_11 ).
cnf(c_0_17,plain,
( s(X1,u1r2(X1))
| ~ s2least(X1) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_18,plain,
( s2least(X1)
| ~ c(X1) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_19,plain,
( c(X1)
| ~ e(X1) ),
c_0_12 ).
cnf(c_0_20,negated_conjecture,
e(exist),
clause_1 ).
cnf(c_0_21,plain,
( s1most(X1)
| ~ d(X1) ),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_22,plain,
( d(X1)
| ~ f(X1) ),
c_0_13 ).
cnf(c_0_23,negated_conjecture,
f(exist),
clause_2 ).
cnf(c_0_24,plain,
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
c_0_14 ).
cnf(c_0_25,plain,
( equalish(X1,u1r1(X2))
| ~ s1most(X2)
| ~ s(X2,X1)
| ~ s2least(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_26,plain,
( s(X1,u1r2(X1))
| ~ s2least(X1) ),
c_0_17 ).
cnf(c_0_27,plain,
( s2least(X1)
| ~ c(X1) ),
c_0_18 ).
cnf(c_0_28,negated_conjecture,
c(exist),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
( s1most(X1)
| ~ d(X1) ),
c_0_21 ).
cnf(c_0_30,negated_conjecture,
d(exist),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,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_32,negated_conjecture,
s2least(exist),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
s1most(exist),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS003-1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 13:35:18 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.98nqYEPIkL/E---3.1_13605.p
% 0.20/0.48 # Version: 3.1.0
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 13685 completed with status 0
% 0.20/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.48 # Starting sh5l with 136s (1) cores
% 0.20/0.48 # SAT001_MinMin_p005000_rr_RG with pid 13689 completed with status 0
% 0.20/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Unsatisfiable
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 16
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 16
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 16
% 0.20/0.48 # Processed clauses : 37
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 37
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 1
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 12
% 0.20/0.48 # ...of the previous two non-redundant : 7
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 1
% 0.20/0.48 # Paramodulations : 12
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 1
% 0.20/0.48 # ...of those cached : 0
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 20
% 0.20/0.48 # Positive orientable unit clauses : 6
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 0
% 0.20/0.48 # Non-unit-clauses : 14
% 0.20/0.48 # Current number of unprocessed clauses: 2
% 0.20/0.48 # ...number of literals in the above : 8
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 17
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 34
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 30
% 0.20/0.48 # Non-unit clause-clause subsumptions : 2
% 0.20/0.48 # Unit Clause-clause subsumption calls : 0
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 0
% 0.20/0.48 # BW rewrite match successes : 0
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 587
% 0.20/0.48 # Search garbage collected termcells : 37
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.003 s
% 0.20/0.48 # System time : 0.002 s
% 0.20/0.48 # Total time : 0.005 s
% 0.20/0.48 # Maximum resident set size: 1620 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.013 s
% 0.20/0.48 # System time : 0.009 s
% 0.20/0.48 # Total time : 0.022 s
% 0.20/0.48 # Maximum resident set size: 1692 pages
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------