%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV399+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 18:16:28 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 6 unt; 0 def)
% Number of atoms : 80 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 77 ( 29 ~; 30 |; 12 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 74 ( 2 sgn 38 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l35_co,conjecture,
! [X1] :
( ? [X2,X3] :
( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X3) )
=> ! [X4] :
? [X5,X6] :
( pair_in_list(update_slb(X1,X4),X5,X6)
& strictly_less_than(X5,X6) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l35_co) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(l35_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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l35_li3839) ).
fof(transitivity,axiom,
! [X1,X2,X3] :
( ( less_than(X1,X2)
& less_than(X2,X3) )
=> less_than(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',transitivity) ).
fof(l35_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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l35_li3637) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ? [X2,X3] :
( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X3) )
=> ! [X4] :
? [X5,X6] :
( pair_in_list(update_slb(X1,X4),X5,X6)
& strictly_less_than(X5,X6) ) ),
inference(assume_negation,[status(cth)],[l35_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] :
( ~ 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)],[l35_li3839])]) ).
fof(c_0_10,negated_conjecture,
! [X11,X12] :
( pair_in_list(esk1_0,esk2_0,esk3_0)
& strictly_less_than(esk2_0,esk3_0)
& ( ~ pair_in_list(update_slb(esk1_0,esk4_0),X11,X12)
| ~ strictly_less_than(X11,X12) ) ),
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])])])])])]) ).
cnf(c_0_11,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_12,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,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_9]) ).
cnf(c_0_14,negated_conjecture,
pair_in_list(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X4,X5,X6] :
( ~ less_than(X4,X5)
| ~ less_than(X5,X6)
| less_than(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity])]) ).
cnf(c_0_16,plain,
( less_than(X1,X2)
| ~ strictly_less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
strictly_less_than(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
( ~ strictly_less_than(X1,X2)
| ~ pair_in_list(update_slb(esk1_0,esk4_0),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)
| ~ strictly_less_than(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( less_than(X1,X2)
| ~ less_than(X3,X2)
| ~ less_than(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
less_than(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_23,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)],[l35_li3637])]) ).
cnf(c_0_24,negated_conjecture,
( less_than(X1,X2)
| ~ pair_in_list(update_slb(esk1_0,esk4_0),X2,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)
| less_than(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( less_than(X1,esk3_0)
| ~ less_than(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,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_23]) ).
cnf(c_0_28,negated_conjecture,
less_than(esk4_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_30,lemma,
( pair_in_list(update_slb(X1,esk4_0),X2,esk3_0)
| ~ pair_in_list(X1,X2,esk3_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV399+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jun 15 18:27:37 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.016 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 32
% 0.24/1.41 # Proof object clause steps : 19
% 0.24/1.41 # Proof object formula steps : 13
% 0.24/1.41 # Proof object conjectures : 14
% 0.24/1.41 # Proof object clause conjectures : 11
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 9
% 0.24/1.41 # Proof object initial formulas used : 6
% 0.24/1.41 # Proof object generating inferences : 9
% 0.24/1.41 # Proof object simplifying inferences : 4
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 21
% 0.24/1.41 # Removed by relevancy pruning/SinE : 7
% 0.24/1.41 # Initial clauses : 23
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 23
% 0.24/1.41 # Processed clauses : 96
% 0.24/1.41 # ...of these trivial : 3
% 0.24/1.41 # ...subsumed : 28
% 0.24/1.41 # ...remaining for further processing : 65
% 0.24/1.41 # Other redundant clauses eliminated : 3
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 0
% 0.24/1.41 # Generated clauses : 250
% 0.24/1.41 # ...of the previous two non-trivial : 211
% 0.24/1.41 # Contextual simplify-reflections : 9
% 0.24/1.41 # Paramodulations : 240
% 0.24/1.41 # Factorizations : 8
% 0.24/1.41 # Equation resolutions : 3
% 0.24/1.41 # Current number of processed clauses : 63
% 0.24/1.41 # Positive orientable unit clauses : 11
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 6
% 0.24/1.41 # Non-unit-clauses : 46
% 0.24/1.41 # Current number of unprocessed clauses: 138
% 0.24/1.41 # ...number of literals in the above : 440
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 0
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 640
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 562
% 0.24/1.41 # Non-unit clause-clause subsumptions : 35
% 0.24/1.41 # Unit Clause-clause subsumption calls : 72
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 5
% 0.24/1.41 # BW rewrite match successes : 0
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 4042
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.020 s
% 0.24/1.41 # System time : 0.002 s
% 0.24/1.41 # Total time : 0.023 s
% 0.24/1.41 # Maximum resident set size: 3092 pages
%------------------------------------------------------------------------------