TSTP Solution File: SWC317+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC317+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:00 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 98 ( 32 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 120 ( 41 ~; 42 |; 25 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 14 !; 4 ?)
% 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)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X1
& app(X6,cons(X5,nil)) = X2 ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(cons(X7,nil),X8) != X3
| app(X8,cons(X7,nil)) != X4 ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X1
& app(X6,cons(X5,nil)) = X2 ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(cons(X7,nil),X8) != X3
| app(X8,cons(X7,nil)) != X4 ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_2,negated_conjecture,
! [X13,X14] :
( 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(X13)
| ~ ssList(X14)
| app(cons(X13,nil),X14) != esk1_0
| app(X14,cons(X13,nil)) != esk2_0 )
& ( ~ neq(esk4_0,nil)
| ~ ssItem(X13)
| ~ ssList(X14)
| app(cons(X13,nil),X14) != esk1_0
| app(X14,cons(X13,nil)) != esk2_0 )
& ( neq(esk2_0,nil)
| ssItem(esk5_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk5_0) )
& ( neq(esk2_0,nil)
| ssList(esk6_0) )
& ( ~ neq(esk4_0,nil)
| ssList(esk6_0) )
& ( neq(esk2_0,nil)
| app(cons(esk5_0,nil),esk6_0) = esk3_0 )
& ( ~ neq(esk4_0,nil)
| app(cons(esk5_0,nil),esk6_0) = esk3_0 )
& ( neq(esk2_0,nil)
| app(esk6_0,cons(esk5_0,nil)) = esk4_0 )
& ( ~ neq(esk4_0,nil)
| app(esk6_0,cons(esk5_0,nil)) = esk4_0 ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_1])])])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( app(X1,cons(X2,nil)) != esk2_0
| app(cons(X2,nil),X1) != esk1_0
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( ssList(esk6_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( app(X1,cons(X2,nil)) != esk4_0
| app(cons(X2,nil),X1) != esk1_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_5]),c_0_7])]) ).
cnf(c_0_13,negated_conjecture,
app(esk6_0,cons(esk5_0,nil)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]) ).
cnf(c_0_14,negated_conjecture,
app(cons(esk5_0,nil),esk6_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_7])]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7])]) ).
cnf(c_0_16,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_17,negated_conjecture,
~ ssItem(esk5_0),
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])]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_7])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC317+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n010.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 23:10:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.019 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 19
% 0.23/1.42 # Proof object clause steps : 16
% 0.23/1.42 # Proof object formula steps : 3
% 0.23/1.42 # Proof object conjectures : 19
% 0.23/1.42 # Proof object clause conjectures : 16
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 8
% 0.23/1.42 # Proof object initial formulas used : 1
% 0.23/1.42 # Proof object generating inferences : 1
% 0.23/1.42 # Proof object simplifying inferences : 18
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 96
% 0.23/1.42 # Removed by relevancy pruning/SinE : 77
% 0.23/1.42 # Initial clauses : 45
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 45
% 0.23/1.42 # Processed clauses : 47
% 0.23/1.42 # ...of these trivial : 8
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 38
% 0.23/1.42 # Other redundant clauses eliminated : 2
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 1
% 0.23/1.42 # Generated clauses : 102
% 0.23/1.42 # ...of the previous two non-trivial : 86
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 96
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 6
% 0.23/1.42 # Current number of processed clauses : 35
% 0.23/1.42 # Positive orientable unit clauses : 11
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 2
% 0.23/1.42 # Non-unit-clauses : 22
% 0.23/1.42 # Current number of unprocessed clauses: 84
% 0.23/1.42 # ...number of literals in the above : 421
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 1
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 68
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 30
% 0.23/1.42 # Non-unit clause-clause subsumptions : 0
% 0.23/1.42 # Unit Clause-clause subsumption calls : 9
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 1
% 0.23/1.42 # BW rewrite match successes : 1
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 5207
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.024 s
% 0.23/1.42 # System time : 0.001 s
% 0.23/1.42 # Total time : 0.025 s
% 0.23/1.42 # Maximum resident set size: 3160 pages
%------------------------------------------------------------------------------