TSTP Solution File: SWV381+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV381+1 : TPTP v8.1.2. Released v3.3.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:57:07 EDT 2023
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 3 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 76 ( 29 ~; 28 |; 10 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 72 ( 0 sgn; 42 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.biodRfdzkG/E---3.1_7674.p',stricly_smaller_definition) ).
fof(l17_l18,lemma,
! [X1,X2,X3] :
( ? [X4] :
( contains_cpq(triple(X1,X2,X3),X4)
& strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) )
=> ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/tmp/tmp.biodRfdzkG/E---3.1_7674.p',l17_l18) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.biodRfdzkG/E---3.1_7674.p',totality) ).
fof(l17_co,conjecture,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/tmp/tmp.biodRfdzkG/E---3.1_7674.p',l17_co) ).
fof(ax10,axiom,
! [X1,X2] :
( issmallestelement_pq(X1,X2)
<=> ! [X3] :
( contains_pq(X1,X3)
=> less_than(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.biodRfdzkG/E---3.1_7674.p',ax10) ).
fof(l17_li56,lemma,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_pq(i(triple(X1,X2,X3)),X4) ),
file('/export/starexec/sandbox/tmp/tmp.biodRfdzkG/E---3.1_7674.p',l17_li56) ).
fof(c_0_6,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
fof(c_0_7,lemma,
! [X1,X2,X3] :
( ? [X4] :
( contains_cpq(triple(X1,X2,X3),X4)
& strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) )
=> ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[l17_l18]) ).
fof(c_0_8,plain,
! [X82,X83] :
( ( less_than(X82,X83)
| ~ strictly_less_than(X82,X83) )
& ( ~ less_than(X83,X82)
| ~ strictly_less_than(X82,X83) )
& ( ~ less_than(X82,X83)
| less_than(X83,X82)
| strictly_less_than(X82,X83) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X38,X39] :
( less_than(X38,X39)
| less_than(X39,X38) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_10,lemma,
! [X27,X28,X29,X30] :
( ~ contains_cpq(triple(X27,X28,X29),X30)
| ~ strictly_less_than(X30,findmin_cpq_res(triple(X27,X28,X29)))
| ~ phi(findmin_cpq_eff(triple(X27,X28,X29))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_11,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[l17_co]) ).
cnf(c_0_14,lemma,
( ~ contains_cpq(triple(X1,X2,X3),X4)
| ~ strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,negated_conjecture,
( phi(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
& ~ issmallestelement_pq(i(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_17,plain,
! [X9,X10,X11,X12,X13] :
( ( ~ issmallestelement_pq(X9,X10)
| ~ contains_pq(X9,X11)
| less_than(X10,X11) )
& ( contains_pq(X12,esk4_2(X12,X13))
| issmallestelement_pq(X12,X13) )
& ( ~ less_than(X13,esk4_2(X12,X13))
| issmallestelement_pq(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[ax10])])])])])]) ).
cnf(c_0_18,lemma,
( less_than(findmin_cpq_res(triple(X1,X2,X3)),X4)
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3)))
| ~ contains_cpq(triple(X1,X2,X3),X4) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
phi(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,lemma,
! [X92,X93,X94,X95] :
( ( ~ contains_cpq(triple(X92,X93,X94),X95)
| contains_pq(i(triple(X92,X93,X94)),X95) )
& ( ~ contains_pq(i(triple(X92,X93,X94)),X95)
| contains_cpq(triple(X92,X93,X94),X95) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l17_li56])]) ).
cnf(c_0_21,plain,
( issmallestelement_pq(X2,X1)
| ~ less_than(X1,esk4_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( less_than(findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)),X1)
| ~ contains_cpq(triple(esk1_0,esk2_0,esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,lemma,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_pq(i(triple(X1,X2,X3)),X4) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
( contains_pq(X1,esk4_2(X1,X2))
| issmallestelement_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( issmallestelement_pq(X1,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))
| ~ contains_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_2(X1,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,lemma,
( contains_cpq(triple(X1,X2,X3),esk4_2(i(triple(X1,X2,X3)),X4))
| issmallestelement_pq(i(triple(X1,X2,X3)),X4) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
~ issmallestelement_pq(i(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV381+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n026.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 03:33:44 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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.biodRfdzkG/E---3.1_7674.p
% 0.19/0.51 # Version: 3.1pre001
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # new_bool_3 with pid 7841 completed with status 0
% 0.19/0.51 # Result found by new_bool_3
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.19/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 7848 completed with status 0
% 0.19/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.19/0.51 # Preprocessing time : 0.003 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 65
% 0.19/0.51 # Removed by relevancy pruning/SinE : 31
% 0.19/0.51 # Initial clauses : 49
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 49
% 0.19/0.51 # Processed clauses : 182
% 0.19/0.51 # ...of these trivial : 2
% 0.19/0.51 # ...subsumed : 33
% 0.19/0.51 # ...remaining for further processing : 147
% 0.19/0.51 # Other redundant clauses eliminated : 2
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 0
% 0.19/0.51 # Backward-rewritten : 0
% 0.19/0.51 # Generated clauses : 235
% 0.19/0.51 # ...of the previous two non-redundant : 190
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 3
% 0.19/0.51 # Paramodulations : 209
% 0.19/0.51 # Factorizations : 24
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 2
% 0.19/0.51 # Total rewrite steps : 39
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 96
% 0.19/0.51 # Positive orientable unit clauses : 13
% 0.19/0.51 # Positive unorientable unit clauses: 1
% 0.19/0.51 # Negative unit clauses : 3
% 0.19/0.51 # Non-unit-clauses : 79
% 0.19/0.51 # Current number of unprocessed clauses: 100
% 0.19/0.51 # ...number of literals in the above : 377
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 49
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 1462
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 975
% 0.19/0.51 # Non-unit clause-clause subsumptions : 32
% 0.19/0.51 # Unit Clause-clause subsumption calls : 4
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 2
% 0.19/0.51 # BW rewrite match successes : 0
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 7333
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.019 s
% 0.19/0.51 # System time : 0.006 s
% 0.19/0.51 # Total time : 0.024 s
% 0.19/0.51 # Maximum resident set size: 2044 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.022 s
% 0.19/0.51 # System time : 0.007 s
% 0.19/0.51 # Total time : 0.029 s
% 0.19/0.51 # Maximum resident set size: 1752 pages
% 0.19/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------