%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV413+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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:31 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 3 unt; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 31 ( 11 ~; 7 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 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 : 25 ( 0 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l49_co,conjecture,
! [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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l49_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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l49_li3637) ).
fof(c_0_2,negated_conjecture,
~ ! [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) ) ),
inference(assume_negation,[status(cth)],[l49_co]) ).
fof(c_0_3,negated_conjecture,
! [X10] :
( pair_in_list(esk1_0,esk2_0,esk3_0)
& strictly_less_than(esk2_0,esk4_0)
& less_than(esk4_0,esk3_0)
& ( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,X10)
| ~ less_than(esk4_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_2])])])])])]) ).
fof(c_0_4,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_5,negated_conjecture,
( ~ less_than(esk4_0,X1)
| ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,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_4]) ).
cnf(c_0_7,negated_conjecture,
( ~ pair_in_list(esk1_0,esk2_0,X1)
| ~ less_than(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
pair_in_list(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
less_than(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV413+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 16 01:25:57 EDT 2022
% 0.14/0.35 % 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.016 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 : 11
% 0.25/1.42 # Proof object clause steps : 6
% 0.25/1.42 # Proof object formula steps : 5
% 0.25/1.42 # Proof object conjectures : 8
% 0.25/1.42 # Proof object clause conjectures : 5
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 4
% 0.25/1.42 # Proof object initial formulas used : 2
% 0.25/1.42 # Proof object generating inferences : 2
% 0.25/1.42 # Proof object simplifying inferences : 2
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 20
% 0.25/1.42 # Removed by relevancy pruning/SinE : 7
% 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 : 31
% 0.25/1.42 # ...of these trivial : 2
% 0.25/1.42 # ...subsumed : 1
% 0.25/1.42 # ...remaining for further processing : 28
% 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 : 0
% 0.25/1.42 # Backward-rewritten : 0
% 0.25/1.42 # Generated clauses : 29
% 0.25/1.42 # ...of the previous two non-trivial : 19
% 0.25/1.42 # Contextual simplify-reflections : 1
% 0.25/1.42 # Paramodulations : 25
% 0.25/1.42 # Factorizations : 2
% 0.25/1.42 # Equation resolutions : 3
% 0.25/1.42 # Current number of processed clauses : 26
% 0.25/1.42 # Positive orientable unit clauses : 7
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 3
% 0.25/1.42 # Non-unit-clauses : 16
% 0.25/1.42 # Current number of unprocessed clauses: 11
% 0.25/1.42 # ...number of literals in the above : 23
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 0
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 12
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 11
% 0.25/1.42 # Non-unit clause-clause subsumptions : 2
% 0.25/1.42 # Unit Clause-clause subsumption calls : 10
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 1
% 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 : 1610
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.013 s
% 0.25/1.42 # System time : 0.004 s
% 0.25/1.42 # Total time : 0.017 s
% 0.25/1.42 # Maximum resident set size: 2824 pages
%------------------------------------------------------------------------------