TSTP Solution File: SWC372+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC372+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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 : Tue Jul 19 20:28:20 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 11 unt; 0 def)
% Number of atoms : 112 ( 34 equ)
% Maximal formula atoms : 19 ( 5 avg)
% Number of connectives : 138 ( 48 ~; 46 |; 30 &)
% ( 1 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 22 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| segmentP(X2,X1)
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| segmentP(X2,X1)
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk8_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk9_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk8_2(X5,X6),X6),esk9_2(X5,X6)) = X5
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ~ ssList(X9)
| ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) ) ),
inference(distribute,[status(thm)],[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)],[ax7])])])])])])]) ).
fof(c_0_6,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_7,negated_conjecture,
! [X15,X16,X17,X18] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& app(esk3_0,esk5_0) = esk4_0
& strictorderedP(esk3_0)
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk5_0
| ~ ssItem(X17)
| ~ ssList(X18)
| app(X18,cons(X17,nil)) != esk3_0
| ~ lt(X17,X15) )
& ~ segmentP(esk2_0,esk1_0)
& ( nil = esk4_0
| nil != esk3_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)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])])]) ).
cnf(c_0_8,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_11,negated_conjecture,
app(esk3_0,esk5_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_15,negated_conjecture,
app(esk1_0,esk5_0) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( segmentP(X1,esk1_0)
| esk2_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC372+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n019.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 : Sat Jun 11 21:15:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.022 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 22
% 0.22/1.41 # Proof object clause steps : 14
% 0.22/1.41 # Proof object formula steps : 8
% 0.22/1.41 # Proof object conjectures : 13
% 0.22/1.41 # Proof object clause conjectures : 10
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 10
% 0.22/1.41 # Proof object initial formulas used : 4
% 0.22/1.41 # Proof object generating inferences : 3
% 0.22/1.41 # Proof object simplifying inferences : 9
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 96
% 0.22/1.41 # Removed by relevancy pruning/SinE : 49
% 0.22/1.41 # Initial clauses : 84
% 0.22/1.41 # Removed in clause preprocessing : 1
% 0.22/1.41 # Initial clauses in saturation : 83
% 0.22/1.41 # Processed clauses : 6992
% 0.22/1.41 # ...of these trivial : 144
% 0.22/1.41 # ...subsumed : 5934
% 0.22/1.41 # ...remaining for further processing : 914
% 0.22/1.41 # Other redundant clauses eliminated : 65
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 87
% 0.22/1.41 # Backward-rewritten : 16
% 0.22/1.41 # Generated clauses : 27924
% 0.22/1.41 # ...of the previous two non-trivial : 25299
% 0.22/1.41 # Contextual simplify-reflections : 5166
% 0.22/1.41 # Paramodulations : 27800
% 0.22/1.41 # Factorizations : 0
% 0.22/1.42 # Equation resolutions : 109
% 0.22/1.42 # Current number of processed clauses : 795
% 0.22/1.42 # Positive orientable unit clauses : 21
% 0.22/1.42 # Positive unorientable unit clauses: 0
% 0.22/1.42 # Negative unit clauses : 9
% 0.22/1.42 # Non-unit-clauses : 765
% 0.22/1.42 # Current number of unprocessed clauses: 17404
% 0.22/1.42 # ...number of literals in the above : 102263
% 0.22/1.42 # Current number of archived formulas : 0
% 0.22/1.42 # Current number of archived clauses : 118
% 0.22/1.42 # Clause-clause subsumption calls (NU) : 605549
% 0.22/1.42 # Rec. Clause-clause subsumption calls : 495086
% 0.22/1.42 # Non-unit clause-clause subsumptions : 9588
% 0.22/1.42 # Unit Clause-clause subsumption calls : 646
% 0.22/1.42 # Rewrite failures with RHS unbound : 0
% 0.22/1.42 # BW rewrite match attempts : 5
% 0.22/1.42 # BW rewrite match successes : 5
% 0.22/1.42 # Condensation attempts : 0
% 0.22/1.42 # Condensation successes : 0
% 0.22/1.42 # Termbank termtop insertions : 485160
% 0.22/1.42
% 0.22/1.42 # -------------------------------------------------
% 0.22/1.42 # User time : 0.676 s
% 0.22/1.42 # System time : 0.018 s
% 0.22/1.42 # Total time : 0.694 s
% 0.22/1.42 # Maximum resident set size: 19324 pages
%------------------------------------------------------------------------------