TSTP Solution File: SWC355+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC355+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:14 EDT 2022
% Result : Theorem 0.13s 1.34s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 13 unt; 0 def)
% Number of atoms : 126 ( 24 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 151 ( 58 ~; 57 |; 20 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 22 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> app(X3,cons(X5,nil)) != X4 )
| segmentP(X2,X1) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> app(X3,cons(X5,nil)) != X4 )
| segmentP(X2,X1) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_6,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ssItem(esk5_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk5_0) )
& ( neq(esk2_0,nil)
| app(esk3_0,cons(esk5_0,nil)) = esk4_0 )
& ( ~ neq(esk4_0,nil)
| app(esk3_0,cons(esk5_0,nil)) = esk4_0 )
& ( neq(esk2_0,nil)
| ~ segmentP(esk2_0,esk1_0) )
& ( ~ neq(esk4_0,nil)
| ~ segmentP(esk2_0,esk1_0) ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_5])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_8,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_9,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_10,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,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_8]) ).
cnf(c_0_13,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_15,negated_conjecture,
( app(esk3_0,cons(esk5_0,nil)) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,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_12,c_0_13]),c_0_14])]) ).
cnf(c_0_20,negated_conjecture,
app(esk1_0,cons(esk5_0,nil)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_22,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| ssList(cons(X4,X3)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])])]) ).
cnf(c_0_23,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
( ~ segmentP(esk4_0,esk1_0)
| ~ neq(esk4_0,nil) ),
inference(rw,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_25,negated_conjecture,
( segmentP(X1,esk1_0)
| esk4_0 != X1
| ~ ssList(cons(esk5_0,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_26,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_17])]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,negated_conjecture,
~ segmentP(esk4_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_17])]) ).
cnf(c_0_30,negated_conjecture,
( segmentP(X1,esk1_0)
| esk4_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_14]),c_0_27])]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_28,c_0_11]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : SWC355+1 : TPTP v8.1.0. Released v2.4.0.
% 0.02/0.09 % Command : run_ET %s %d
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Sun Jun 12 06:25:55 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.13/1.34 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.13/1.34 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.13/1.34 # Preprocessing time : 0.012 s
% 0.13/1.34
% 0.13/1.34 # Proof found!
% 0.13/1.34 # SZS status Theorem
% 0.13/1.34 # SZS output start CNFRefutation
% See solution above
% 0.13/1.34 # Proof object total steps : 33
% 0.13/1.34 # Proof object clause steps : 23
% 0.13/1.34 # Proof object formula steps : 10
% 0.13/1.34 # Proof object conjectures : 21
% 0.13/1.34 # Proof object clause conjectures : 18
% 0.13/1.34 # Proof object formula conjectures : 3
% 0.13/1.34 # Proof object initial clauses used : 12
% 0.13/1.34 # Proof object initial formulas used : 5
% 0.13/1.34 # Proof object generating inferences : 4
% 0.13/1.34 # Proof object simplifying inferences : 20
% 0.13/1.34 # Training examples: 0 positive, 0 negative
% 0.13/1.34 # Parsed axioms : 96
% 0.13/1.34 # Removed by relevancy pruning/SinE : 70
% 0.13/1.34 # Initial clauses : 52
% 0.13/1.34 # Removed in clause preprocessing : 0
% 0.13/1.34 # Initial clauses in saturation : 52
% 0.13/1.34 # Processed clauses : 1222
% 0.13/1.34 # ...of these trivial : 54
% 0.13/1.34 # ...subsumed : 864
% 0.13/1.34 # ...remaining for further processing : 304
% 0.13/1.34 # Other redundant clauses eliminated : 7
% 0.13/1.34 # Clauses deleted for lack of memory : 0
% 0.13/1.34 # Backward-subsumed : 28
% 0.13/1.34 # Backward-rewritten : 12
% 0.13/1.34 # Generated clauses : 3564
% 0.13/1.34 # ...of the previous two non-trivial : 2987
% 0.13/1.34 # Contextual simplify-reflections : 179
% 0.13/1.34 # Paramodulations : 3543
% 0.13/1.34 # Factorizations : 0
% 0.13/1.34 # Equation resolutions : 21
% 0.13/1.34 # Current number of processed clauses : 262
% 0.13/1.34 # Positive orientable unit clauses : 37
% 0.13/1.34 # Positive unorientable unit clauses: 0
% 0.13/1.34 # Negative unit clauses : 30
% 0.13/1.34 # Non-unit-clauses : 195
% 0.13/1.34 # Current number of unprocessed clauses: 1646
% 0.13/1.34 # ...number of literals in the above : 7554
% 0.13/1.34 # Current number of archived formulas : 0
% 0.13/1.34 # Current number of archived clauses : 40
% 0.13/1.34 # Clause-clause subsumption calls (NU) : 12444
% 0.13/1.34 # Rec. Clause-clause subsumption calls : 7821
% 0.13/1.34 # Non-unit clause-clause subsumptions : 347
% 0.13/1.34 # Unit Clause-clause subsumption calls : 268
% 0.13/1.34 # Rewrite failures with RHS unbound : 0
% 0.13/1.34 # BW rewrite match attempts : 43
% 0.13/1.34 # BW rewrite match successes : 12
% 0.13/1.34 # Condensation attempts : 0
% 0.13/1.34 # Condensation successes : 0
% 0.13/1.34 # Termbank termtop insertions : 74495
% 0.13/1.34
% 0.13/1.34 # -------------------------------------------------
% 0.13/1.34 # User time : 0.106 s
% 0.13/1.34 # System time : 0.006 s
% 0.13/1.34 # Total time : 0.112 s
% 0.13/1.34 # Maximum resident set size: 5028 pages
%------------------------------------------------------------------------------