TSTP Solution File: SWC043+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC043+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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:20 EDT 2022
% Result : Theorem 0.20s 1.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 15 unt; 0 def)
% Number of atoms : 109 ( 54 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 131 ( 46 ~; 43 |; 29 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 18 !; 8 ?)
% 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)
=> ( 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) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_3,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)
=> ( 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) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_4,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(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)],[ax83])])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X15,X16,X17,X18] :
( 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
& 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) )
& ( 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_3])])])])])])]) ).
cnf(c_0_6,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
nil = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
app(esk3_0,esk5_0) = esk4_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,plain,
( esk2_0 = X1
| app(X2,X1) != esk2_0
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
cnf(c_0_12,negated_conjecture,
app(esk1_0,esk5_0) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_13,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( nil = X1
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
esk5_0 = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_17,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_18,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,plain,
( esk2_0 = X1
| app(X1,X2) != esk2_0
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_7]),c_0_7]) ).
cnf(c_0_20,negated_conjecture,
app(esk1_0,esk2_0) = esk2_0,
inference(rw,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_21,plain,
ssList(esk2_0),
inference(rw,[status(thm)],[c_0_17,c_0_7]) ).
cnf(c_0_22,negated_conjecture,
esk2_0 != esk1_0,
inference(rw,[status(thm)],[c_0_18,c_0_7]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_14])]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWC043+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.11 % Command : run_ET %s %d
% 0.11/0.32 % Computer : n015.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jun 12 21:08:52 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.20/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.39 # Preprocessing time : 0.013 s
% 0.20/1.39
% 0.20/1.39 # Proof found!
% 0.20/1.39 # SZS status Theorem
% 0.20/1.39 # SZS output start CNFRefutation
% See solution above
% 0.20/1.39 # Proof object total steps : 24
% 0.20/1.39 # Proof object clause steps : 18
% 0.20/1.39 # Proof object formula steps : 6
% 0.20/1.39 # Proof object conjectures : 15
% 0.20/1.39 # Proof object clause conjectures : 12
% 0.20/1.39 # Proof object formula conjectures : 3
% 0.20/1.39 # Proof object initial clauses used : 10
% 0.20/1.39 # Proof object initial formulas used : 3
% 0.20/1.39 # Proof object generating inferences : 2
% 0.20/1.39 # Proof object simplifying inferences : 16
% 0.20/1.39 # Training examples: 0 positive, 0 negative
% 0.20/1.39 # Parsed axioms : 96
% 0.20/1.39 # Removed by relevancy pruning/SinE : 56
% 0.20/1.39 # Initial clauses : 74
% 0.20/1.39 # Removed in clause preprocessing : 1
% 0.20/1.39 # Initial clauses in saturation : 73
% 0.20/1.39 # Processed clauses : 78
% 0.20/1.39 # ...of these trivial : 4
% 0.20/1.39 # ...subsumed : 2
% 0.20/1.39 # ...remaining for further processing : 72
% 0.20/1.39 # Other redundant clauses eliminated : 2
% 0.20/1.39 # Clauses deleted for lack of memory : 0
% 0.20/1.39 # Backward-subsumed : 0
% 0.20/1.39 # Backward-rewritten : 5
% 0.20/1.39 # Generated clauses : 196
% 0.20/1.39 # ...of the previous two non-trivial : 162
% 0.20/1.39 # Contextual simplify-reflections : 1
% 0.20/1.39 # Paramodulations : 188
% 0.20/1.39 # Factorizations : 0
% 0.20/1.39 # Equation resolutions : 8
% 0.20/1.39 # Current number of processed clauses : 66
% 0.20/1.39 # Positive orientable unit clauses : 11
% 0.20/1.39 # Positive unorientable unit clauses: 0
% 0.20/1.39 # Negative unit clauses : 2
% 0.20/1.39 # Non-unit-clauses : 53
% 0.20/1.39 # Current number of unprocessed clauses: 143
% 0.20/1.39 # ...number of literals in the above : 895
% 0.20/1.39 # Current number of archived formulas : 0
% 0.20/1.39 # Current number of archived clauses : 5
% 0.20/1.39 # Clause-clause subsumption calls (NU) : 658
% 0.20/1.39 # Rec. Clause-clause subsumption calls : 183
% 0.20/1.39 # Non-unit clause-clause subsumptions : 3
% 0.20/1.39 # Unit Clause-clause subsumption calls : 50
% 0.20/1.39 # Rewrite failures with RHS unbound : 0
% 0.20/1.39 # BW rewrite match attempts : 2
% 0.20/1.39 # BW rewrite match successes : 2
% 0.20/1.39 # Condensation attempts : 0
% 0.20/1.39 # Condensation successes : 0
% 0.20/1.39 # Termbank termtop insertions : 9451
% 0.20/1.39
% 0.20/1.39 # -------------------------------------------------
% 0.20/1.39 # User time : 0.018 s
% 0.20/1.39 # System time : 0.001 s
% 0.20/1.39 # Total time : 0.019 s
% 0.20/1.39 # Maximum resident set size: 3196 pages
%------------------------------------------------------------------------------