TSTP Solution File: SWC037-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC037-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n009.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 : Wed May 31 12:38:58 EDT 2023
% Result : Unsatisfiable 0.14s 0.31s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 50 ( 14 unt; 0 def)
% Number of atoms : 100 ( 26 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 94 ( 44 ~; 44 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 10 (; 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f80,axiom,
! [U] :
( ~ segmentP(nil,U)
| ~ ssList(U)
| nil = U ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f115,axiom,
! [U,V] :
( U != V
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f190,negated_conjecture,
nil = sk2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f191,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f192,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f193,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f195,negated_conjecture,
( ssList(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f199,negated_conjecture,
( neq(sk5,nil)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f200,negated_conjecture,
( segmentP(sk4,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f209,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f282,plain,
! [X0] :
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[status(esa)],[f80]) ).
fof(f322,plain,
! [U] :
( ! [V] :
( U != V
| ~ neq(U,V)
| ~ ssList(V) )
| ~ ssList(U) ),
inference(miniscoping,[status(esa)],[f115]) ).
fof(f323,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f322]) ).
fof(f436,plain,
nil = sk2,
inference(cnf_transformation,[status(esa)],[f190]) ).
fof(f437,plain,
sk2 = sk4,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f438,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f439,plain,
nil != sk1,
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f441,plain,
( ssList(sk5)
| nil = sk3 ),
inference(cnf_transformation,[status(esa)],[f195]) ).
fof(f445,plain,
( neq(sk5,nil)
| nil = sk3 ),
inference(cnf_transformation,[status(esa)],[f199]) ).
fof(f446,plain,
( segmentP(sk4,sk5)
| nil = sk3 ),
inference(cnf_transformation,[status(esa)],[f200]) ).
fof(f455,plain,
( spl0_2
<=> ssList(sk5) ),
introduced(split_symbol_definition) ).
fof(f462,plain,
( spl0_4
<=> nil = sk3 ),
introduced(split_symbol_definition) ).
fof(f463,plain,
( nil = sk3
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f462]) ).
fof(f465,plain,
( spl0_2
| spl0_4 ),
inference(split_clause,[status(thm)],[f441,f455,f462]) ).
fof(f466,plain,
( spl0_5
<=> neq(sk5,nil) ),
introduced(split_symbol_definition) ).
fof(f467,plain,
( neq(sk5,nil)
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f466]) ).
fof(f470,plain,
( spl0_6
<=> segmentP(sk4,sk5) ),
introduced(split_symbol_definition) ).
fof(f471,plain,
( segmentP(sk4,sk5)
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f470]) ).
fof(f478,plain,
( spl0_5
| spl0_4 ),
inference(split_clause,[status(thm)],[f445,f466,f462]) ).
fof(f479,plain,
( spl0_6
| spl0_4 ),
inference(split_clause,[status(thm)],[f446,f470,f462]) ).
fof(f488,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(destructive_equality_resolution,[status(esa)],[f323]) ).
fof(f489,plain,
! [X0] :
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(duplicate_literals_removal,[status(esa)],[f488]) ).
fof(f511,plain,
nil = sk4,
inference(forward_demodulation,[status(thm)],[f436,f437]) ).
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(f524,plain,
( $false
| spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f516,f209]) ).
fof(f525,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f524]) ).
fof(f526,plain,
( nil = sk1
| ~ spl0_4 ),
inference(forward_demodulation,[status(thm)],[f438,f463]) ).
fof(f527,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f526,f439]) ).
fof(f528,plain,
~ spl0_4,
inference(contradiction_clause,[status(thm)],[f527]) ).
fof(f529,plain,
( segmentP(nil,sk5)
| ~ spl0_6 ),
inference(forward_demodulation,[status(thm)],[f511,f471]) ).
fof(f532,plain,
( spl0_10
<=> nil = sk5 ),
introduced(split_symbol_definition) ).
fof(f533,plain,
( nil = sk5
| ~ spl0_10 ),
inference(component_clause,[status(thm)],[f532]) ).
fof(f535,plain,
( ~ ssList(sk5)
| nil = sk5
| ~ spl0_6 ),
inference(resolution,[status(thm)],[f529,f282]) ).
fof(f536,plain,
( ~ spl0_2
| spl0_10
| ~ spl0_6 ),
inference(split_clause,[status(thm)],[f535,f455,f532,f470]) ).
fof(f538,plain,
( neq(nil,nil)
| ~ spl0_10
| ~ spl0_5 ),
inference(backward_demodulation,[status(thm)],[f533,f467]) ).
fof(f544,plain,
( ~ ssList(nil)
| ~ spl0_10
| ~ spl0_5 ),
inference(resolution,[status(thm)],[f538,f489]) ).
fof(f545,plain,
( ~ spl0_8
| ~ spl0_10
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f544,f514,f532,f466]) ).
fof(f546,plain,
$false,
inference(sat_refutation,[status(thm)],[f465,f478,f479,f525,f528,f536,f545]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SWC037-1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.09 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.29 % Computer : n009.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue May 30 11:20:16 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.09/0.31 % Drodi V3.5.1
% 0.14/0.31 % Refutation found
% 0.14/0.31 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.53 % Elapsed time: 0.022673 seconds
% 0.14/0.53 % CPU time: 0.017740 seconds
% 0.14/0.53 % Memory used: 4.043 MB
%------------------------------------------------------------------------------