TSTP Solution File: SWC040+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC040+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n007.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 : 300s
% DateTime : Tue Apr 30 20:44:16 EDT 2024
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 88 ( 45 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 94 ( 28 ~; 24 |; 28 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 18 ( 12 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil != V
| V != X
| U != W
| nil = U
| ( nil != W
& nil = X )
| ( ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ( app(cons(Y,nil),Z) != W
| app(Z,cons(Y,nil)) != X ) ) )
& neq(X,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil != V
| V != X
| U != W
| nil = U
| ( nil != W
& nil = X )
| ( ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ( app(cons(Y,nil),Z) != W
| app(Z,cons(Y,nil)) != X ) ) )
& neq(X,nil) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& nil = V
& V = X
& U = W
& nil != U
& ( nil = W
| nil != X )
& ( ? [Y] :
( ssItem(Y)
& ? [Z] :
( ssList(Z)
& app(cons(Y,nil),Z) = W
& app(Z,cons(Y,nil)) = X ) )
| ~ neq(X,nil) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
( ssList(sk0_47)
& ssList(sk0_48)
& ssList(sk0_49)
& ssList(sk0_50)
& nil = sk0_48
& sk0_48 = sk0_50
& sk0_47 = sk0_49
& nil != sk0_47
& ( nil = sk0_49
| nil != sk0_50 )
& ( ( ssItem(sk0_51)
& ssList(sk0_52)
& app(cons(sk0_51,nil),sk0_52) = sk0_49
& app(sk0_52,cons(sk0_51,nil)) = sk0_50 )
| ~ neq(sk0_50,nil) ) ),
inference(skolemization,[status(esa)],[f415]) ).
fof(f421,plain,
nil = sk0_48,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f422,plain,
sk0_48 = sk0_50,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f423,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
nil != sk0_47,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f425,plain,
( nil = sk0_49
| nil != sk0_50 ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f430,plain,
( spl0_0
<=> nil = sk0_49 ),
introduced(split_symbol_definition) ).
fof(f431,plain,
( nil = sk0_49
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f430]) ).
fof(f433,plain,
( spl0_1
<=> nil = sk0_50 ),
introduced(split_symbol_definition) ).
fof(f435,plain,
( nil != sk0_50
| spl0_1 ),
inference(component_clause,[status(thm)],[f433]) ).
fof(f436,plain,
( spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f425,f430,f433]) ).
fof(f487,plain,
nil = sk0_50,
inference(forward_demodulation,[status(thm)],[f421,f422]) ).
fof(f490,plain,
( nil != nil
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f487,f435]) ).
fof(f491,plain,
( $false
| spl0_1 ),
inference(trivial_equality_resolution,[status(esa)],[f490]) ).
fof(f492,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f491]) ).
fof(f493,plain,
( nil = sk0_47
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f423,f431]) ).
fof(f494,plain,
( $false
| ~ spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f493,f424]) ).
fof(f495,plain,
~ spl0_0,
inference(contradiction_clause,[status(thm)],[f494]) ).
fof(f496,plain,
$false,
inference(sat_refutation,[status(thm)],[f436,f492,f495]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC040+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.35 % Computer : n007.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Mon Apr 29 23:54:32 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.12/0.37 % Drodi V3.6.0
% 0.12/0.37 % Refutation found
% 0.12/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.40 % Elapsed time: 0.028593 seconds
% 0.19/0.40 % CPU time: 0.037637 seconds
% 0.19/0.40 % Total memory used: 14.587 MB
% 0.19/0.40 % Net memory used: 14.558 MB
%------------------------------------------------------------------------------