TSTP Solution File: SWV408+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV408+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 600s
% DateTime : Wed Jul 20 18:16:30 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 4 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 78 ( 28 ~; 32 |; 12 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 70 ( 2 sgn 39 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l48_li3839,lemma,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X3,X4) )
=> pair_in_list(update_slb(X1,X4),X2,X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l48_li3839) ).
fof(l45_li4647,lemma,
! [X1,X2] :
( contains_slb(X1,X2)
=> ? [X3] : pair_in_list(X1,X2,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l45_li4647) ).
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(l44_co,conjecture,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) )
=> ( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))
| ? [X5] :
( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5)
& less_than(findmin_pqp_res(X1),X5) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l44_co) ).
fof(l49_li3637,lemma,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& less_than(X4,X3) )
=> pair_in_list(update_slb(X1,X4),X2,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l49_li3637) ).
fof(c_0_6,lemma,
! [X5,X6,X7,X8] :
( ~ pair_in_list(X5,X6,X7)
| ~ strictly_less_than(X7,X8)
| pair_in_list(update_slb(X5,X8),X6,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l48_li3839])]) ).
fof(c_0_7,lemma,
! [X4,X5] :
( ~ contains_slb(X4,X5)
| pair_in_list(X4,X5,esk5_2(X4,X5)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l45_li4647])])])])]) ).
fof(c_0_8,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_9,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[totality]) ).
cnf(c_0_10,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| ~ strictly_less_than(X4,X2)
| ~ pair_in_list(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,lemma,
( pair_in_list(X1,X2,esk5_2(X1,X2))
| ~ contains_slb(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) )
=> ( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))
| ? [X5] :
( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5)
& less_than(findmin_pqp_res(X1),X5) ) ) ),
inference(assume_negation,[status(cth)],[l44_co]) ).
cnf(c_0_15,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(esk5_2(X1,X3),X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_17,negated_conjecture,
! [X10] :
( contains_slb(esk2_0,esk4_0)
& strictly_less_than(esk4_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))
& ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,findmin_pqp_res(esk1_0))
& ( ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,X10)
| ~ less_than(findmin_pqp_res(esk1_0),X10) ) ),
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)],[c_0_14])])])])])]) ).
fof(c_0_18,lemma,
! [X5,X6,X7,X8] :
( ~ pair_in_list(X5,X6,X7)
| ~ less_than(X8,X7)
| pair_in_list(update_slb(X5,X8),X6,X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l49_li3637])]) ).
cnf(c_0_19,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| less_than(X2,esk5_2(X1,X3))
| ~ contains_slb(X1,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
contains_slb(esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,lemma,
( pair_in_list(update_slb(X1,X2),X3,X4)
| ~ less_than(X2,X4)
| ~ pair_in_list(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( pair_in_list(update_slb(esk2_0,X1),esk4_0,X1)
| less_than(X1,esk5_2(esk2_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,lemma,
( pair_in_list(update_slb(X1,X2),X3,esk5_2(esk2_0,esk4_0))
| pair_in_list(update_slb(esk2_0,X2),esk4_0,X2)
| ~ pair_in_list(X1,X3,esk5_2(esk2_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( ~ less_than(findmin_pqp_res(esk1_0),X1)
| ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,lemma,
( pair_in_list(update_slb(esk2_0,X1),esk4_0,esk5_2(esk2_0,esk4_0))
| pair_in_list(update_slb(esk2_0,X1),esk4_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_11]),c_0_20])]) ).
cnf(c_0_26,negated_conjecture,
~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),esk4_0,findmin_pqp_res(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
~ less_than(findmin_pqp_res(esk1_0),esk5_2(esk2_0,esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_22]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV408+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 15 16:40:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.017 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 29
% 0.21/1.40 # Proof object clause steps : 16
% 0.21/1.40 # Proof object formula steps : 13
% 0.21/1.40 # Proof object conjectures : 9
% 0.21/1.40 # Proof object clause conjectures : 6
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 8
% 0.21/1.40 # Proof object initial formulas used : 6
% 0.21/1.40 # Proof object generating inferences : 7
% 0.21/1.40 # Proof object simplifying inferences : 5
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 45
% 0.21/1.40 # Removed by relevancy pruning/SinE : 19
% 0.21/1.40 # Initial clauses : 36
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 36
% 0.21/1.40 # Processed clauses : 625
% 0.21/1.40 # ...of these trivial : 2
% 0.21/1.40 # ...subsumed : 382
% 0.21/1.40 # ...remaining for further processing : 241
% 0.21/1.40 # Other redundant clauses eliminated : 3
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 5
% 0.21/1.40 # Backward-rewritten : 0
% 0.21/1.40 # Generated clauses : 4197
% 0.21/1.40 # ...of the previous two non-trivial : 3739
% 0.21/1.40 # Contextual simplify-reflections : 374
% 0.21/1.40 # Paramodulations : 4037
% 0.21/1.40 # Factorizations : 158
% 0.21/1.40 # Equation resolutions : 3
% 0.21/1.40 # Current number of processed clauses : 234
% 0.21/1.40 # Positive orientable unit clauses : 12
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 6
% 0.21/1.40 # Non-unit-clauses : 216
% 0.21/1.40 # Current number of unprocessed clauses: 3072
% 0.21/1.40 # ...number of literals in the above : 17273
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 5
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 23042
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 12269
% 0.21/1.40 # Non-unit clause-clause subsumptions : 753
% 0.21/1.40 # Unit Clause-clause subsumption calls : 13
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 5
% 0.21/1.40 # BW rewrite match successes : 0
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 89464
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.155 s
% 0.21/1.40 # System time : 0.006 s
% 0.21/1.40 # Total time : 0.161 s
% 0.21/1.40 # Maximum resident set size: 6216 pages
%------------------------------------------------------------------------------