TSTP Solution File: SWC398+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC398+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:30 EDT 2022
% Result : Theorem 0.18s 1.36s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 10 unt; 0 def)
% Number of atoms : 97 ( 25 equ)
% Maximal formula atoms : 19 ( 5 avg)
% Number of connectives : 119 ( 39 ~; 39 |; 25 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 21 !; 6 ?)
% 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
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X1,X9)
| memberP(X2,X9) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(c_0_2,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
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X1,X9)
| memberP(X2,X9) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_3,negated_conjecture,
! [X15,X16,X17] :
( 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
& equalelemsP(esk3_0)
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk5_0
| ~ ssList(X17)
| app(X17,cons(X15,nil)) != esk3_0 )
& ssItem(esk6_0)
& memberP(esk1_0,esk6_0)
& ~ memberP(esk2_0,esk6_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_2])])])])])])]) ).
fof(c_0_4,plain,
! [X4,X5,X6] :
( ( ~ memberP(app(X5,X6),X4)
| memberP(X5,X4)
| memberP(X6,X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X5,X4)
| memberP(app(X5,X6),X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X6,X4)
| memberP(app(X5,X6),X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ) ),
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)],[ax36])])])])])]) ).
cnf(c_0_5,negated_conjecture,
app(esk3_0,esk5_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,plain,
( memberP(app(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
app(esk1_0,esk5_0) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_10,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
~ memberP(esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
( memberP(esk2_0,X1)
| ~ memberP(esk1_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
memberP(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SWC398+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.10 % Command : run_ET %s %d
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Sat Jun 11 22:36:55 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.18/1.36 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.18/1.36 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.18/1.36 # Preprocessing time : 0.016 s
% 0.18/1.36
% 0.18/1.36 # Proof found!
% 0.18/1.36 # SZS status Theorem
% 0.18/1.36 # SZS output start CNFRefutation
% See solution above
% 0.18/1.36 # Proof object total steps : 17
% 0.18/1.36 # Proof object clause steps : 12
% 0.18/1.36 # Proof object formula steps : 5
% 0.18/1.36 # Proof object conjectures : 14
% 0.18/1.36 # Proof object clause conjectures : 11
% 0.18/1.36 # Proof object formula conjectures : 3
% 0.18/1.36 # Proof object initial clauses used : 9
% 0.18/1.36 # Proof object initial formulas used : 2
% 0.18/1.36 # Proof object generating inferences : 2
% 0.18/1.36 # Proof object simplifying inferences : 8
% 0.18/1.36 # Training examples: 0 positive, 0 negative
% 0.18/1.36 # Parsed axioms : 96
% 0.18/1.36 # Removed by relevancy pruning/SinE : 72
% 0.18/1.36 # Initial clauses : 57
% 0.18/1.36 # Removed in clause preprocessing : 0
% 0.18/1.36 # Initial clauses in saturation : 57
% 0.18/1.36 # Processed clauses : 172
% 0.18/1.36 # ...of these trivial : 2
% 0.18/1.36 # ...subsumed : 53
% 0.18/1.36 # ...remaining for further processing : 117
% 0.18/1.36 # Other redundant clauses eliminated : 10
% 0.18/1.36 # Clauses deleted for lack of memory : 0
% 0.18/1.36 # Backward-subsumed : 3
% 0.18/1.36 # Backward-rewritten : 0
% 0.18/1.36 # Generated clauses : 799
% 0.18/1.36 # ...of the previous two non-trivial : 694
% 0.18/1.36 # Contextual simplify-reflections : 34
% 0.18/1.36 # Paramodulations : 777
% 0.18/1.36 # Factorizations : 0
% 0.18/1.36 # Equation resolutions : 22
% 0.18/1.36 # Current number of processed clauses : 113
% 0.18/1.36 # Positive orientable unit clauses : 14
% 0.18/1.36 # Positive unorientable unit clauses: 0
% 0.18/1.36 # Negative unit clauses : 3
% 0.18/1.36 # Non-unit-clauses : 96
% 0.18/1.36 # Current number of unprocessed clauses: 572
% 0.18/1.36 # ...number of literals in the above : 3422
% 0.18/1.36 # Current number of archived formulas : 0
% 0.18/1.36 # Current number of archived clauses : 3
% 0.18/1.36 # Clause-clause subsumption calls (NU) : 2139
% 0.18/1.36 # Rec. Clause-clause subsumption calls : 967
% 0.18/1.36 # Non-unit clause-clause subsumptions : 69
% 0.18/1.36 # Unit Clause-clause subsumption calls : 69
% 0.18/1.36 # Rewrite failures with RHS unbound : 0
% 0.18/1.36 # BW rewrite match attempts : 0
% 0.18/1.36 # BW rewrite match successes : 0
% 0.18/1.36 # Condensation attempts : 0
% 0.18/1.36 # Condensation successes : 0
% 0.18/1.36 # Termbank termtop insertions : 17592
% 0.18/1.36
% 0.18/1.36 # -------------------------------------------------
% 0.18/1.36 # User time : 0.035 s
% 0.18/1.36 # System time : 0.005 s
% 0.18/1.36 # Total time : 0.040 s
% 0.18/1.36 # Maximum resident set size: 3708 pages
%------------------------------------------------------------------------------