TSTP Solution File: SWC037+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC037+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:26:18 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 14 unt; 0 def)
% Number of atoms : 111 ( 45 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 121 ( 41 ~; 46 |; 19 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 21 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ segmentP(X4,X5)
| ~ segmentP(X3,X5) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X2
| X2 != X4
| X1 != X3
| nil = X1
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ segmentP(X4,X5)
| ~ segmentP(X3,X5) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& nil = esk2_0
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& nil != esk1_0
& ( nil = esk4_0
| ssList(esk5_0) )
& ( nil = esk3_0
| ssList(esk5_0) )
& ( nil = esk4_0
| neq(esk5_0,nil) )
& ( nil = esk3_0
| neq(esk5_0,nil) )
& ( nil = esk4_0
| segmentP(esk4_0,esk5_0) )
& ( nil = esk3_0
| segmentP(esk4_0,esk5_0) )
& ( nil = esk4_0
| segmentP(esk3_0,esk5_0) )
& ( nil = esk3_0
| segmentP(esk3_0,esk5_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_4])])])])])])]) ).
fof(c_0_6,plain,
! [X2] :
( ( ~ segmentP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| segmentP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
cnf(c_0_7,negated_conjecture,
( segmentP(esk4_0,esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
nil = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( ssList(esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( neq(esk5_0,nil)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( esk2_0 = esk1_0
| segmentP(esk2_0,esk5_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]) ).
cnf(c_0_16,negated_conjecture,
esk2_0 != esk1_0,
inference(rw,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( esk2_0 = esk1_0
| ssList(esk5_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_8]),c_0_9]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[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)],[ax15])])])])])]) ).
cnf(c_0_19,negated_conjecture,
( esk2_0 = esk1_0
| neq(esk5_0,esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_8]),c_0_9]),c_0_8]) ).
cnf(c_0_20,plain,
( esk2_0 = X1
| ~ segmentP(esk2_0,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_8]),c_0_8]) ).
cnf(c_0_21,negated_conjecture,
segmentP(esk2_0,esk5_0),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk5_0),
inference(sr,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
neq(esk5_0,esk2_0),
inference(sr,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
esk5_0 = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_26,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
neq(esk2_0,esk2_0),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
ssList(esk2_0),
inference(rw,[status(thm)],[c_0_26,c_0_8]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC037+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 21:17:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.020 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 31
% 0.24/1.42 # Proof object clause steps : 23
% 0.24/1.42 # Proof object formula steps : 8
% 0.24/1.42 # Proof object conjectures : 20
% 0.24/1.42 # Proof object clause conjectures : 17
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 10
% 0.24/1.42 # Proof object initial formulas used : 4
% 0.24/1.42 # Proof object generating inferences : 2
% 0.24/1.42 # Proof object simplifying inferences : 21
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 96
% 0.24/1.42 # Removed by relevancy pruning/SinE : 70
% 0.24/1.42 # Initial clauses : 54
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 54
% 0.24/1.42 # Processed clauses : 62
% 0.24/1.42 # ...of these trivial : 7
% 0.24/1.42 # ...subsumed : 0
% 0.24/1.42 # ...remaining for further processing : 55
% 0.24/1.42 # Other redundant clauses eliminated : 3
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 5
% 0.24/1.42 # Generated clauses : 135
% 0.24/1.42 # ...of the previous two non-trivial : 117
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 123
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 8
% 0.24/1.42 # Current number of processed clauses : 44
% 0.24/1.42 # Positive orientable unit clauses : 9
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 2
% 0.24/1.42 # Non-unit-clauses : 33
% 0.24/1.42 # Current number of unprocessed clauses: 100
% 0.24/1.42 # ...number of literals in the above : 590
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 9
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 373
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 96
% 0.24/1.42 # Non-unit clause-clause subsumptions : 0
% 0.24/1.42 # Unit Clause-clause subsumption calls : 45
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 2
% 0.24/1.42 # BW rewrite match successes : 2
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 6332
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.021 s
% 0.24/1.42 # System time : 0.006 s
% 0.24/1.42 # Total time : 0.027 s
% 0.24/1.42 # Maximum resident set size: 3176 pages
%------------------------------------------------------------------------------