TSTP Solution File: SWV403+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV403+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 9 unt; 0 def)
% Number of atoms : 113 ( 25 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 108 ( 38 ~; 46 |; 14 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 110 ( 13 sgn 62 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l39_co,conjecture,
! [X1] :
( ! [X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X3,X4) )
=> pair_in_list(update_slb(X1,X4),X2,X4) )
=> ! [X5,X6,X7,X8,X9] :
( ( pair_in_list(insert_slb(X1,pair(X8,X9)),X5,X6)
& strictly_less_than(X6,X7) )
=> pair_in_list(update_slb(insert_slb(X1,pair(X8,X9)),X7),X5,X7) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l39_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(ax23,axiom,
! [X1,X2,X3,X4,X5] :
( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
<=> ( pair_in_list(X1,X3,X5)
| ( X2 = X3
& X4 = X5 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax23) ).
fof(ax29,axiom,
! [X1,X2,X3,X4] :
( strictly_less_than(X4,X3)
=> update_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(update_slb(X1,X3),pair(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax29) ).
fof(ax30,axiom,
! [X1,X2,X3,X4] :
( less_than(X3,X4)
=> update_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(update_slb(X1,X3),pair(X2,X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax30) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ! [X2,X3,X4] :
( ( pair_in_list(X1,X2,X3)
& strictly_less_than(X3,X4) )
=> pair_in_list(update_slb(X1,X4),X2,X4) )
=> ! [X5,X6,X7,X8,X9] :
( ( pair_in_list(insert_slb(X1,pair(X8,X9)),X5,X6)
& strictly_less_than(X6,X7) )
=> pair_in_list(update_slb(insert_slb(X1,pair(X8,X9)),X7),X5,X7) ) ),
inference(assume_negation,[status(cth)],[l39_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,plain,
! [X6,X7,X8,X9,X10,X6,X7,X8,X9,X10] :
( ( X7 = X8
| pair_in_list(X6,X8,X10)
| ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( X9 = X10
| pair_in_list(X6,X8,X10)
| ~ pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( ~ pair_in_list(X6,X8,X10)
| pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) )
& ( X7 != X8
| X9 != X10
| pair_in_list(insert_slb(X6,pair(X7,X9)),X8,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])])])]) ).
fof(c_0_10,negated_conjecture,
! [X11,X12,X13] :
( ( ~ pair_in_list(esk1_0,X11,X12)
| ~ strictly_less_than(X12,X13)
| pair_in_list(update_slb(esk1_0,X13),X11,X13) )
& pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk2_0,esk3_0)
& strictly_less_than(esk3_0,esk4_0)
& ~ pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk4_0) ),
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_11,plain,
! [X5,X6,X7,X8] :
( ~ strictly_less_than(X8,X7)
| update_slb(insert_slb(X5,pair(X6,X8)),X7) = insert_slb(update_slb(X5,X7),pair(X6,X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax29])]) ).
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_7]) ).
cnf(c_0_13,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X5,X6,X7,X8] :
( ~ less_than(X7,X8)
| update_slb(insert_slb(X5,pair(X6,X8)),X7) = insert_slb(update_slb(X5,X7),pair(X6,X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax30])]) ).
cnf(c_0_15,plain,
( pair_in_list(X1,X4,X5)
| X3 = X5
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X4))
| ~ strictly_less_than(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
~ pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X3))
| ~ less_than(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( pair_in_list(X1,X4,X5)
| X2 = X4
| ~ pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
( pair_in_list(update_slb(esk1_0,X1),X2,X1)
| ~ strictly_less_than(X3,X1)
| ~ pair_in_list(esk1_0,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,negated_conjecture,
( esk6_0 = esk3_0
| pair_in_list(esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
( update_slb(insert_slb(X1,pair(X2,X3)),X4) = insert_slb(update_slb(X1,X4),pair(X2,X4))
| less_than(X4,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( ~ pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk6_0)),esk2_0,esk4_0)
| ~ less_than(esk4_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| ~ pair_in_list(X1,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,negated_conjecture,
( esk2_0 = esk5_0
| pair_in_list(esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_28,negated_conjecture,
( esk6_0 = esk3_0
| pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)
| ~ strictly_less_than(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
strictly_less_than(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,negated_conjecture,
( less_than(esk4_0,esk6_0)
| ~ pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk4_0)),esk2_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0)
| ~ less_than(esk4_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( esk2_0 = esk5_0
| pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)
| ~ strictly_less_than(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( esk6_0 = esk3_0
| pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_31]) ).
cnf(c_0_35,plain,
( ~ strictly_less_than(X1,X2)
| ~ less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_36,negated_conjecture,
( esk2_0 = esk5_0
| pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_29]) ).
cnf(c_0_37,plain,
( pair_in_list(insert_slb(X1,pair(X2,X3)),X4,X5)
| X3 != X5
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_38,negated_conjecture,
esk6_0 = esk3_0,
inference(sr,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
~ less_than(esk4_0,esk3_0),
inference(spm,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_40,negated_conjecture,
esk2_0 = esk5_0,
inference(sr,[status(thm)],[c_0_36,c_0_34]) ).
cnf(c_0_41,plain,
pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_37])]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_38]),c_0_39]),c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV403+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 20:36:24 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.016 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 43
% 0.23/1.40 # Proof object clause steps : 30
% 0.23/1.40 # Proof object formula steps : 13
% 0.23/1.40 # Proof object conjectures : 21
% 0.23/1.40 # Proof object clause conjectures : 18
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 13
% 0.23/1.40 # Proof object initial formulas used : 6
% 0.23/1.40 # Proof object generating inferences : 12
% 0.23/1.40 # Proof object simplifying inferences : 11
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 19
% 0.23/1.40 # Removed by relevancy pruning/SinE : 7
% 0.23/1.40 # Initial clauses : 22
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 22
% 0.23/1.40 # Processed clauses : 55
% 0.23/1.40 # ...of these trivial : 1
% 0.23/1.40 # ...subsumed : 5
% 0.23/1.40 # ...remaining for further processing : 48
% 0.23/1.40 # Other redundant clauses eliminated : 3
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 0
% 0.23/1.40 # Backward-rewritten : 14
% 0.23/1.40 # Generated clauses : 54
% 0.23/1.40 # ...of the previous two non-trivial : 51
% 0.23/1.40 # Contextual simplify-reflections : 2
% 0.23/1.40 # Paramodulations : 48
% 0.23/1.40 # Factorizations : 2
% 0.23/1.40 # Equation resolutions : 3
% 0.23/1.40 # Current number of processed clauses : 30
% 0.23/1.40 # Positive orientable unit clauses : 9
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 4
% 0.23/1.40 # Non-unit-clauses : 17
% 0.23/1.40 # Current number of unprocessed clauses: 12
% 0.23/1.40 # ...number of literals in the above : 28
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 16
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 84
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 76
% 0.23/1.40 # Non-unit clause-clause subsumptions : 7
% 0.23/1.40 # Unit Clause-clause subsumption calls : 38
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 10
% 0.23/1.40 # BW rewrite match successes : 2
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 2000
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.017 s
% 0.23/1.40 # System time : 0.002 s
% 0.23/1.40 # Total time : 0.019 s
% 0.23/1.40 # Maximum resident set size: 2964 pages
%------------------------------------------------------------------------------