TSTP Solution File: KRS003_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS003_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:11:50 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 22
% Syntax : Number of formulae : 49 ( 7 unt; 13 typ; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 70 ( 33 ~; 26 |; 4 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 12 ( 10 >; 2 *; 0 +; 0 <<)
% 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 33 !; 0 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
unreal: $tType ).
tff(decl_sort2,type,
real: $tType ).
tff(decl_22,type,
u1r1: unreal > real ).
tff(decl_23,type,
u1r2: unreal > real ).
tff(decl_26,type,
exist: unreal ).
tff(decl_27,type,
f: unreal > $o ).
tff(decl_28,type,
d: unreal > $o ).
tff(decl_29,type,
e: unreal > $o ).
tff(decl_30,type,
s1most: unreal > $o ).
tff(decl_31,type,
s: ( unreal * real ) > $o ).
tff(decl_32,type,
c: unreal > $o ).
tff(decl_33,type,
equalish: ( real * real ) > $o ).
tff(decl_34,type,
s2least: unreal > $o ).
tff(clause_1__clause_2,conjecture,
( ~ e(exist)
| ~ f(exist) ),
file('/export/starexec/sandbox/tmp/tmp.eM76EP7abJ/E---3.1_1420.p',clause_1__clause_2) ).
tff(clause_11,axiom,
! [X2: real,X3: real,X1: unreal] :
( ( s1most(X1)
& s(X1,X3)
& s(X1,X2) )
=> equalish(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.eM76EP7abJ/E---3.1_1420.p',clause_11) ).
tff(clause_6,axiom,
! [X1: unreal] :
( s2least(X1)
=> s(X1,u1r1(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.eM76EP7abJ/E---3.1_1420.p',clause_6) ).
tff(clause_15,axiom,
! [X1: unreal] :
( e(X1)
=> c(X1) ),
file('/export/starexec/sandbox/tmp/tmp.eM76EP7abJ/E---3.1_1420.p',clause_15) ).
tff(clause_16,axiom,
! [X1: unreal] :
( f(X1)
=> d(X1) ),
file('/export/starexec/sandbox/tmp/tmp.eM76EP7abJ/E---3.1_1420.p',clause_16) ).
tff(clause_5,axiom,
! [X1: unreal] :
~ ( s2least(X1)
& equalish(u1r2(X1),u1r1(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.eM76EP7abJ/E---3.1_1420.p',clause_5) ).
tff(clause_7,axiom,
! [X1: unreal] :
( s2least(X1)
=> s(X1,u1r2(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.eM76EP7abJ/E---3.1_1420.p',clause_7) ).
tff(clause_3,axiom,
! [X1: unreal] :
( c(X1)
=> s2least(X1) ),
file('/export/starexec/sandbox/tmp/tmp.eM76EP7abJ/E---3.1_1420.p',clause_3) ).
tff(clause_9,axiom,
! [X1: unreal] :
( d(X1)
=> s1most(X1) ),
file('/export/starexec/sandbox/tmp/tmp.eM76EP7abJ/E---3.1_1420.p',clause_9) ).
tff(c_0_9,negated_conjecture,
~ ( ~ e(exist)
| ~ f(exist) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[clause_1__clause_2])]) ).
tff(c_0_10,plain,
! [X10: real,X11: real,X12: unreal] :
( ~ s1most(X12)
| ~ s(X12,X11)
| ~ s(X12,X10)
| equalish(X11,X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_11])])]) ).
tff(c_0_11,plain,
! [X17: unreal] :
( ~ s2least(X17)
| s(X17,u1r1(X17)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_6])])]) ).
tff(c_0_12,plain,
! [X5: unreal] :
( ~ e(X5)
| c(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_15])])]) ).
tff(c_0_13,negated_conjecture,
( e(exist)
& f(exist) ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
tff(c_0_14,plain,
! [X4: unreal] :
( ~ f(X4)
| d(X4) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_16])])]) ).
tff(c_0_15,plain,
! [X16: unreal] :
( ~ s2least(X16)
| ~ equalish(u1r2(X16),u1r1(X16)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_5])])]) ).
tcf(c_0_16,plain,
! [X1: unreal,X2: real,X3: real] :
( equalish(X2,X3)
| ~ s1most(X1)
| ~ s(X1,X2)
| ~ s(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_17,plain,
! [X1: unreal] :
( s(X1,u1r1(X1))
| ~ s2least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tff(c_0_18,plain,
! [X18: unreal] :
( ~ s2least(X18)
| s(X18,u1r2(X18)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_7])])]) ).
tff(c_0_19,plain,
! [X8: unreal] :
( ~ c(X8)
| s2least(X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_3])])]) ).
tcf(c_0_20,plain,
! [X1: unreal] :
( c(X1)
| ~ e(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_21,negated_conjecture,
e(exist),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tff(c_0_22,plain,
! [X6: unreal] :
( ~ d(X6)
| s1most(X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[clause_9])])]) ).
tcf(c_0_23,plain,
! [X1: unreal] :
( d(X1)
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_24,negated_conjecture,
f(exist),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_25,plain,
! [X1: unreal] :
( ~ s2least(X1)
| ~ equalish(u1r2(X1),u1r1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_26,plain,
! [X2: real,X1: unreal] :
( equalish(X2,u1r1(X1))
| ~ s2least(X1)
| ~ s(X1,X2)
| ~ s1most(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
tcf(c_0_27,plain,
! [X1: unreal] :
( s(X1,u1r2(X1))
| ~ s2least(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_28,plain,
! [X1: unreal] :
( s2least(X1)
| ~ c(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_29,negated_conjecture,
c(exist),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
tcf(c_0_30,plain,
! [X1: unreal] :
( s1most(X1)
| ~ d(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
tcf(c_0_31,negated_conjecture,
d(exist),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
tcf(c_0_32,plain,
! [X1: unreal] :
( ~ s2least(X1)
| ~ s1most(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
tcf(c_0_33,negated_conjecture,
s2least(exist),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
tcf(c_0_34,negated_conjecture,
s1most(exist),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KRS003_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n016.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 14:23:00 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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/tmp/tmp.eM76EP7abJ/E---3.1_1420.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # sh5l with pid 1502 completed with status 0
% 0.21/0.51 # Result found by sh5l
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51 # SAT001_MinMin_p005000_rr_RG with pid 1508 completed with status 0
% 0.21/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 30
% 0.21/0.51 # Removed by relevancy pruning/SinE : 15
% 0.21/0.51 # Initial clauses : 16
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 16
% 0.21/0.51 # Processed clauses : 38
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 38
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 2
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 12
% 0.21/0.51 # ...of the previous two non-redundant : 7
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 1
% 0.21/0.51 # Paramodulations : 12
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 1
% 0.21/0.51 # ...of those cached : 0
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 20
% 0.21/0.51 # Positive orientable unit clauses : 6
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 0
% 0.21/0.51 # Non-unit-clauses : 14
% 0.21/0.51 # Current number of unprocessed clauses: 1
% 0.21/0.51 # ...number of literals in the above : 4
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 18
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 35
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 30
% 0.21/0.51 # Non-unit clause-clause subsumptions : 3
% 0.21/0.51 # Unit Clause-clause subsumption calls : 0
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 0
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 1207
% 0.21/0.51 # Search garbage collected termcells : 143
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.006 s
% 0.21/0.51 # System time : 0.002 s
% 0.21/0.51 # Total time : 0.008 s
% 0.21/0.51 # Maximum resident set size: 1716 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.007 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.011 s
% 0.21/0.51 # Maximum resident set size: 1716 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------