TSTP Solution File: SWC028-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC028-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n026.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:13 EDT 2024
% Result : Unsatisfiable 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 20
% Syntax : Number of formulae : 74 ( 12 unt; 0 def)
% Number of atoms : 156 ( 38 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 152 ( 70 ~; 73 |; 0 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 12 ( 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f59,axiom,
! [U] :
( ~ ssList(U)
| rearsegP(U,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f82,axiom,
! [U] :
( ~ rearsegP(nil,U)
| ~ ssList(U)
| nil = U ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f115,axiom,
! [U,V] :
( U != V
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f186,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f190,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f191,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f192,negated_conjecture,
( nil = sk2
| nil = sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f195,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f196,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f199,negated_conjecture,
( nil = sk3
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f207,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f258,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f59]) ).
fof(f282,plain,
! [X0] :
( ~ rearsegP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[status(esa)],[f82]) ).
fof(f320,plain,
! [U] :
( ! [V] :
( U != V
| ~ neq(U,V)
| ~ ssList(V) )
| ~ ssList(U) ),
inference(miniscoping,[status(esa)],[f115]) ).
fof(f321,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f320]) ).
fof(f430,plain,
ssList(sk1),
inference(cnf_transformation,[status(esa)],[f186]) ).
fof(f434,plain,
sk2 = sk4,
inference(cnf_transformation,[status(esa)],[f190]) ).
fof(f435,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f436,plain,
( nil = sk2
| nil = sk1 ),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f439,plain,
( nil != sk1
| nil != sk2 ),
inference(cnf_transformation,[status(esa)],[f195]) ).
fof(f440,plain,
( nil = sk4
| neq(sk3,nil) ),
inference(cnf_transformation,[status(esa)],[f196]) ).
fof(f443,plain,
( nil = sk3
| rearsegP(sk4,sk3) ),
inference(cnf_transformation,[status(esa)],[f199]) ).
fof(f451,plain,
( spl0_2
<=> nil = sk2 ),
introduced(split_symbol_definition) ).
fof(f452,plain,
( nil = sk2
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f451]) ).
fof(f454,plain,
( spl0_3
<=> nil = sk1 ),
introduced(split_symbol_definition) ).
fof(f455,plain,
( nil = sk1
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f454]) ).
fof(f456,plain,
( nil != sk1
| spl0_3 ),
inference(component_clause,[status(thm)],[f454]) ).
fof(f457,plain,
( spl0_2
| spl0_3 ),
inference(split_clause,[status(thm)],[f436,f451,f454]) ).
fof(f460,plain,
( ~ spl0_3
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f439,f454,f451]) ).
fof(f461,plain,
( spl0_4
<=> nil = sk4 ),
introduced(split_symbol_definition) ).
fof(f462,plain,
( nil = sk4
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f461]) ).
fof(f464,plain,
( spl0_5
<=> neq(sk3,nil) ),
introduced(split_symbol_definition) ).
fof(f465,plain,
( neq(sk3,nil)
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f464]) ).
fof(f467,plain,
( spl0_4
| spl0_5 ),
inference(split_clause,[status(thm)],[f440,f461,f464]) ).
fof(f468,plain,
( spl0_6
<=> rearsegP(sk4,sk3) ),
introduced(split_symbol_definition) ).
fof(f469,plain,
( rearsegP(sk4,sk3)
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f468]) ).
fof(f472,plain,
( spl0_7
<=> nil = sk3 ),
introduced(split_symbol_definition) ).
fof(f473,plain,
( nil = sk3
| ~ spl0_7 ),
inference(component_clause,[status(thm)],[f472]) ).
fof(f474,plain,
( nil != sk3
| spl0_7 ),
inference(component_clause,[status(thm)],[f472]) ).
fof(f476,plain,
( spl0_7
| spl0_6 ),
inference(split_clause,[status(thm)],[f443,f472,f468]) ).
fof(f484,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(destructive_equality_resolution,[status(esa)],[f321]) ).
fof(f485,plain,
! [X0] :
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(duplicate_literals_removal,[status(esa)],[f484]) ).
fof(f508,plain,
rearsegP(nil,nil),
inference(resolution,[status(thm)],[f258,f207]) ).
fof(f514,plain,
( spl0_8
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f516,plain,
( ~ ssList(nil)
| spl0_8 ),
inference(component_clause,[status(thm)],[f514]) ).
fof(f517,plain,
( spl0_9
<=> nil = nil ),
introduced(split_symbol_definition) ).
fof(f520,plain,
( ~ ssList(nil)
| nil = nil ),
inference(resolution,[status(thm)],[f282,f508]) ).
fof(f521,plain,
( ~ spl0_8
| spl0_9 ),
inference(split_clause,[status(thm)],[f520,f514,f517]) ).
fof(f522,plain,
( $false
| spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f516,f207]) ).
fof(f523,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f522]) ).
fof(f532,plain,
( nil = sk1
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f435,f473]) ).
fof(f538,plain,
( nil = sk2
| ~ spl0_4 ),
inference(forward_demodulation,[status(thm)],[f434,f462]) ).
fof(f544,plain,
( nil != nil
| ~ spl0_7
| spl0_3 ),
inference(forward_demodulation,[status(thm)],[f532,f456]) ).
fof(f545,plain,
( $false
| ~ spl0_7
| spl0_3 ),
inference(trivial_equality_resolution,[status(esa)],[f544]) ).
fof(f546,plain,
( ~ spl0_7
| spl0_3 ),
inference(contradiction_clause,[status(thm)],[f545]) ).
fof(f552,plain,
( rearsegP(sk2,sk3)
| ~ spl0_6 ),
inference(backward_demodulation,[status(thm)],[f434,f469]) ).
fof(f556,plain,
( nil = sk3
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f455,f435]) ).
fof(f557,plain,
( $false
| spl0_7
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f556,f474]) ).
fof(f558,plain,
( spl0_7
| ~ spl0_3 ),
inference(contradiction_clause,[status(thm)],[f557]) ).
fof(f559,plain,
( spl0_2
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f538,f451,f461]) ).
fof(f566,plain,
( rearsegP(nil,sk3)
| ~ spl0_2
| ~ spl0_6 ),
inference(forward_demodulation,[status(thm)],[f452,f552]) ).
fof(f567,plain,
( spl0_10
<=> ssList(sk3) ),
introduced(split_symbol_definition) ).
fof(f569,plain,
( ~ ssList(sk3)
| spl0_10 ),
inference(component_clause,[status(thm)],[f567]) ).
fof(f570,plain,
( ~ ssList(sk3)
| nil = sk3
| ~ spl0_2
| ~ spl0_6 ),
inference(resolution,[status(thm)],[f566,f282]) ).
fof(f571,plain,
( ~ spl0_10
| spl0_7
| ~ spl0_2
| ~ spl0_6 ),
inference(split_clause,[status(thm)],[f570,f567,f472,f451,f468]) ).
fof(f575,plain,
( ~ ssList(sk1)
| spl0_10 ),
inference(backward_demodulation,[status(thm)],[f435,f569]) ).
fof(f576,plain,
( $false
| spl0_10 ),
inference(forward_subsumption_resolution,[status(thm)],[f575,f430]) ).
fof(f577,plain,
spl0_10,
inference(contradiction_clause,[status(thm)],[f576]) ).
fof(f578,plain,
( neq(sk1,nil)
| ~ spl0_5 ),
inference(backward_demodulation,[status(thm)],[f435,f465]) ).
fof(f586,plain,
( neq(nil,nil)
| ~ spl0_7
| ~ spl0_5 ),
inference(forward_demodulation,[status(thm)],[f532,f578]) ).
fof(f588,plain,
( ~ ssList(nil)
| ~ spl0_7
| ~ spl0_5 ),
inference(resolution,[status(thm)],[f586,f485]) ).
fof(f589,plain,
( ~ spl0_8
| ~ spl0_7
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f588,f514,f472,f464]) ).
fof(f590,plain,
$false,
inference(sat_refutation,[status(thm)],[f457,f460,f467,f476,f521,f523,f546,f558,f559,f571,f577,f589]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWC028-1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Apr 30 00:25:04 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.36 % Drodi V3.6.0
% 0.12/0.36 % Refutation found
% 0.12/0.36 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.38 % Elapsed time: 0.026738 seconds
% 0.12/0.38 % CPU time: 0.042889 seconds
% 0.12/0.38 % Total memory used: 14.341 MB
% 0.12/0.38 % Net memory used: 14.313 MB
%------------------------------------------------------------------------------