TSTP Solution File: SWV409+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV409+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 5 unt; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 112 ( 45 ~; 45 |; 16 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-4 aty)
% Number of variables : 71 ( 2 sgn 37 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l45_co,conjecture,
! [X1,X2,X3] :
( ( contains_slb(X1,X2)
& strictly_less_than(X2,X3) )
=> ( pair_in_list(update_slb(X1,X3),X2,X3)
| ? [X4] :
( pair_in_list(update_slb(X1,X3),X2,X4)
& less_than(X3,X4) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l45_co) ).
fof(l45_l49,lemma,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X4)
& less_than(X4,X3) )
=> ? [X5] :
( pair_in_list(update_slb(X1,X4),X2,X5)
& less_than(X4,X5) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l45_l49) ).
fof(l45_l48,lemma,
! [X1,X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X4)
& 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',l45_l48) ).
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(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( ( contains_slb(X1,X2)
& strictly_less_than(X2,X3) )
=> ( pair_in_list(update_slb(X1,X3),X2,X3)
| ? [X4] :
( pair_in_list(update_slb(X1,X3),X2,X4)
& less_than(X3,X4) ) ) ),
inference(assume_negation,[status(cth)],[l45_co]) ).
fof(c_0_7,negated_conjecture,
! [X8] :
( contains_slb(esk1_0,esk2_0)
& strictly_less_than(esk2_0,esk3_0)
& ~ pair_in_list(update_slb(esk1_0,esk3_0),esk2_0,esk3_0)
& ( ~ pair_in_list(update_slb(esk1_0,esk3_0),esk2_0,X8)
| ~ less_than(esk3_0,X8) ) ),
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_6])])])])])]) ).
fof(c_0_8,lemma,
! [X6,X7,X8,X9] :
( ( pair_in_list(update_slb(X6,X9),X7,esk5_4(X6,X7,X8,X9))
| ~ pair_in_list(X6,X7,X8)
| ~ strictly_less_than(X7,X9)
| ~ less_than(X9,X8) )
& ( less_than(X9,esk5_4(X6,X7,X8,X9))
| ~ pair_in_list(X6,X7,X8)
| ~ strictly_less_than(X7,X9)
| ~ less_than(X9,X8) ) ),
inference(distribute,[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)],[l45_l49])])])])])]) ).
fof(c_0_9,lemma,
! [X5,X6,X7,X8] :
( ~ pair_in_list(X5,X6,X7)
| ~ strictly_less_than(X6,X8)
| ~ strictly_less_than(X7,X8)
| pair_in_list(update_slb(X5,X8),X6,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l45_l48])]) ).
fof(c_0_10,lemma,
! [X4,X5] :
( ~ contains_slb(X4,X5)
| pair_in_list(X4,X5,esk4_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_11,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_12,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[totality]) ).
cnf(c_0_13,negated_conjecture,
( ~ less_than(esk3_0,X1)
| ~ pair_in_list(update_slb(esk1_0,esk3_0),esk2_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,lemma,
( pair_in_list(update_slb(X4,X1),X3,esk5_4(X4,X3,X2,X1))
| ~ less_than(X1,X2)
| ~ strictly_less_than(X3,X1)
| ~ pair_in_list(X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
strictly_less_than(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| ~ strictly_less_than(X4,X2)
| ~ strictly_less_than(X3,X2)
| ~ pair_in_list(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,lemma,
( pair_in_list(X1,X2,esk4_2(X1,X2))
| ~ contains_slb(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( ~ pair_in_list(esk1_0,esk2_0,X1)
| ~ less_than(esk3_0,esk5_4(esk1_0,esk2_0,X1,esk3_0))
| ~ less_than(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_21,lemma,
( less_than(X1,esk5_4(X4,X3,X2,X1))
| ~ less_than(X1,X2)
| ~ strictly_less_than(X3,X1)
| ~ pair_in_list(X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(esk4_2(X1,X3),X2)
| ~ strictly_less_than(X3,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,lemma,
( ~ pair_in_list(esk1_0,esk2_0,X1)
| ~ less_than(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15])]) ).
cnf(c_0_25,negated_conjecture,
contains_slb(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| less_than(X2,esk4_2(X1,X3))
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(X3,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,lemma,
~ less_than(esk3_0,esk4_2(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_17]),c_0_25])]) ).
cnf(c_0_28,negated_conjecture,
( pair_in_list(update_slb(X1,esk3_0),esk2_0,esk3_0)
| less_than(esk3_0,esk4_2(X1,esk2_0))
| ~ contains_slb(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_29,negated_conjecture,
~ pair_in_list(update_slb(esk1_0,esk3_0),esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_30,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_25])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV409+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n018.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 : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 17:12:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.017 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 31
% 0.25/1.42 # Proof object clause steps : 18
% 0.25/1.42 # Proof object formula steps : 13
% 0.25/1.42 # Proof object conjectures : 9
% 0.25/1.42 # Proof object clause conjectures : 6
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 10
% 0.25/1.42 # Proof object initial formulas used : 6
% 0.25/1.42 # Proof object generating inferences : 7
% 0.25/1.42 # Proof object simplifying inferences : 10
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 22
% 0.25/1.42 # Removed by relevancy pruning/SinE : 10
% 0.25/1.42 # Initial clauses : 23
% 0.25/1.42 # Removed in clause preprocessing : 0
% 0.25/1.42 # Initial clauses in saturation : 23
% 0.25/1.42 # Processed clauses : 147
% 0.25/1.42 # ...of these trivial : 2
% 0.25/1.42 # ...subsumed : 78
% 0.25/1.42 # ...remaining for further processing : 67
% 0.25/1.42 # Other redundant clauses eliminated : 3
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 1
% 0.25/1.42 # Backward-rewritten : 0
% 0.25/1.42 # Generated clauses : 427
% 0.25/1.42 # ...of the previous two non-trivial : 348
% 0.25/1.42 # Contextual simplify-reflections : 41
% 0.25/1.42 # Paramodulations : 393
% 0.25/1.42 # Factorizations : 32
% 0.25/1.42 # Equation resolutions : 3
% 0.25/1.42 # Current number of processed clauses : 64
% 0.25/1.42 # Positive orientable unit clauses : 6
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 3
% 0.25/1.42 # Non-unit-clauses : 55
% 0.25/1.42 # Current number of unprocessed clauses: 224
% 0.25/1.42 # ...number of literals in the above : 1297
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 1
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 3421
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 2381
% 0.25/1.42 # Non-unit clause-clause subsumptions : 120
% 0.25/1.42 # Unit Clause-clause subsumption calls : 7
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 5
% 0.25/1.42 # BW rewrite match successes : 0
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 7245
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.032 s
% 0.25/1.42 # System time : 0.002 s
% 0.25/1.42 # Total time : 0.034 s
% 0.25/1.42 # Maximum resident set size: 3240 pages
%------------------------------------------------------------------------------