TSTP Solution File: SWV381+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV381+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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 : 600s
% DateTime : Wed Jul 20 18:16:24 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 3 unt; 0 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 87 ( 34 ~; 36 |; 9 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 109 ( 20 sgn 55 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l17_l18) ).
fof(ax39,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax39) ).
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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l17_li56) ).
fof(ax10,axiom,
! [X1,X2] :
( issmallestelement_pq(X1,X2)
<=> ! [X3] :
( contains_pq(X1,X3)
=> less_than(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+1.ax',ax10) ).
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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l17_co) ).
fof(c_0_7,plain,
! [X3,X4,X3,X4] :
( ( less_than(X3,X4)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X4,X3)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X3,X4)
| less_than(X4,X3)
| strictly_less_than(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[stricly_smaller_definition])])])])])]) ).
fof(c_0_8,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_9,lemma,
! [X5,X6,X7,X8] :
( ~ contains_cpq(triple(X5,X6,X7),X8)
| ~ strictly_less_than(X8,findmin_cpq_res(triple(X5,X6,X7)))
| ~ phi(findmin_cpq_eff(triple(X5,X6,X7))) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[l17_l18])])])])])]) ).
cnf(c_0_10,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X5,X6,X7,X8,X5,X6,X7,X8] :
( ( ~ contains_cpq(triple(X5,X6,X7),X8)
| contains_slb(X6,X8) )
& ( ~ contains_slb(X6,X8)
| contains_cpq(triple(X5,X6,X7),X8) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax39])])])]) ).
fof(c_0_13,lemma,
! [X5,X6,X7,X8,X5,X6,X7,X8] :
( ( ~ contains_cpq(triple(X5,X6,X7),X8)
| contains_pq(i(triple(X5,X6,X7)),X8) )
& ( ~ contains_pq(i(triple(X5,X6,X7)),X8)
| contains_cpq(triple(X5,X6,X7),X8) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l17_li56])])])]) ).
cnf(c_0_14,lemma,
( ~ phi(findmin_cpq_eff(triple(X1,X2,X3)))
| ~ strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))
| ~ contains_cpq(triple(X1,X2,X3),X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( contains_slb(X1,X2)
| ~ contains_cpq(triple(X3,X1,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,lemma,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_pq(i(triple(X1,X2,X3)),X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ issmallestelement_pq(X4,X5)
| ~ contains_pq(X4,X6)
| less_than(X5,X6) )
& ( contains_pq(X4,esk4_2(X4,X5))
| issmallestelement_pq(X4,X5) )
& ( ~ less_than(X5,esk4_2(X4,X5))
| issmallestelement_pq(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax10])])])])])])]) ).
cnf(c_0_19,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_20,plain,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,lemma,
( contains_slb(X1,X2)
| ~ contains_pq(i(triple(X3,X1,X4)),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( issmallestelement_pq(X1,X2)
| contains_pq(X1,esk4_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,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_24,lemma,
( less_than(findmin_cpq_res(triple(X1,X2,X3)),X4)
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3)))
| ~ contains_slb(X2,X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,lemma,
( contains_slb(X1,esk4_2(i(triple(X2,X1,X3)),X4))
| issmallestelement_pq(i(triple(X2,X1,X3)),X4) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_26,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_23])])]) ).
cnf(c_0_27,plain,
( issmallestelement_pq(X1,X2)
| ~ less_than(X2,esk4_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,lemma,
( issmallestelement_pq(i(triple(X1,X2,X3)),X4)
| less_than(findmin_cpq_res(triple(X5,X2,X6)),esk4_2(i(triple(X1,X2,X3)),X4))
| ~ phi(findmin_cpq_eff(triple(X5,X2,X6))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,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_26]) ).
cnf(c_0_30,lemma,
( issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X4,X2,X5)))
| ~ phi(findmin_cpq_eff(triple(X4,X2,X5))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
phi(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV381+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 18:57:19 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.018 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 33
% 0.25/1.43 # Proof object clause steps : 18
% 0.25/1.43 # Proof object formula steps : 15
% 0.25/1.43 # Proof object conjectures : 6
% 0.25/1.43 # Proof object clause conjectures : 3
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 10
% 0.25/1.43 # Proof object initial formulas used : 7
% 0.25/1.43 # Proof object generating inferences : 7
% 0.25/1.43 # Proof object simplifying inferences : 3
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 65
% 0.25/1.43 # Removed by relevancy pruning/SinE : 37
% 0.25/1.43 # Initial clauses : 43
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 43
% 0.25/1.43 # Processed clauses : 407
% 0.25/1.43 # ...of these trivial : 13
% 0.25/1.43 # ...subsumed : 236
% 0.25/1.43 # ...remaining for further processing : 158
% 0.25/1.43 # Other redundant clauses eliminated : 2
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 3
% 0.25/1.43 # Backward-rewritten : 0
% 0.25/1.43 # Generated clauses : 6616
% 0.25/1.43 # ...of the previous two non-trivial : 6142
% 0.25/1.43 # Contextual simplify-reflections : 78
% 0.25/1.43 # Paramodulations : 6544
% 0.25/1.43 # Factorizations : 70
% 0.25/1.43 # Equation resolutions : 2
% 0.25/1.43 # Current number of processed clauses : 153
% 0.25/1.43 # Positive orientable unit clauses : 17
% 0.25/1.43 # Positive unorientable unit clauses: 13
% 0.25/1.43 # Negative unit clauses : 3
% 0.25/1.43 # Non-unit-clauses : 120
% 0.25/1.43 # Current number of unprocessed clauses: 5743
% 0.25/1.43 # ...number of literals in the above : 12511
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 3
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 7131
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 4926
% 0.25/1.43 # Non-unit clause-clause subsumptions : 289
% 0.25/1.43 # Unit Clause-clause subsumption calls : 61
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 459
% 0.25/1.43 # BW rewrite match successes : 205
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 90903
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.134 s
% 0.25/1.43 # System time : 0.005 s
% 0.25/1.43 # Total time : 0.139 s
% 0.25/1.43 # Maximum resident set size: 7860 pages
% 0.25/23.43 eprover: CPU time limit exceeded, terminating
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.51 eprover: No such file or directory
%------------------------------------------------------------------------------