TSTP Solution File: SWC254-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC254-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n015.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:39:48 EDT 2023
% Result : Unsatisfiable 0.15s 0.32s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 17
% Syntax : Number of formulae : 52 ( 9 unt; 0 def)
% Number of atoms : 117 ( 12 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 120 ( 55 ~; 57 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 9 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 11 (; 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f86,axiom,
! [U,V] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f116,axiom,
! [U,V] :
( cons(U,nil) != V
| ~ ssItem(U)
| ~ ssList(V)
| singletonP(V) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f190,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f191,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f192,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f199,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f201,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f203,negated_conjecture,
( ~ singletonP(sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f211,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f290,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
inference(cnf_transformation,[status(esa)],[f86]) ).
fof(f326,plain,
! [V] :
( ! [U] :
( cons(U,nil) != V
| ~ ssItem(U) )
| ~ ssList(V)
| singletonP(V) ),
inference(miniscoping,[status(esa)],[f116]) ).
fof(f327,plain,
! [X0,X1] :
( cons(X0,nil) != X1
| ~ ssItem(X0)
| ~ ssList(X1)
| singletonP(X1) ),
inference(cnf_transformation,[status(esa)],[f326]) ).
fof(f438,plain,
sk2 = sk4,
inference(cnf_transformation,[status(esa)],[f190]) ).
fof(f439,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f440,plain,
( neq(sk2,nil)
| neq(sk2,nil) ),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f447,plain,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[status(esa)],[f199]) ).
fof(f449,plain,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[status(esa)],[f201]) ).
fof(f451,plain,
( ~ singletonP(sk1)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[status(esa)],[f203]) ).
fof(f459,plain,
( spl0_2
<=> neq(sk2,nil) ),
introduced(split_symbol_definition) ).
fof(f460,plain,
( neq(sk2,nil)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f459]) ).
fof(f462,plain,
spl0_2,
inference(split_clause,[status(thm)],[f440,f459]) ).
fof(f463,plain,
( spl0_3
<=> neq(sk4,nil) ),
introduced(split_symbol_definition) ).
fof(f465,plain,
( ~ neq(sk4,nil)
| spl0_3 ),
inference(component_clause,[status(thm)],[f463]) ).
fof(f467,plain,
( spl0_4
<=> ssItem(sk5) ),
introduced(split_symbol_definition) ).
fof(f475,plain,
( spl0_6
<=> cons(sk5,nil) = sk3 ),
introduced(split_symbol_definition) ).
fof(f476,plain,
( cons(sk5,nil) = sk3
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f475]) ).
fof(f483,plain,
( spl0_8
<=> singletonP(sk1) ),
introduced(split_symbol_definition) ).
fof(f485,plain,
( ~ singletonP(sk1)
| spl0_8 ),
inference(component_clause,[status(thm)],[f483]) ).
fof(f487,plain,
( spl0_4
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f447,f467,f463]) ).
fof(f489,plain,
( spl0_6
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f449,f475,f463]) ).
fof(f491,plain,
( ~ spl0_8
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f451,f483,f463]) ).
fof(f501,plain,
! [X0] :
( ~ ssItem(X0)
| ~ ssList(cons(X0,nil))
| singletonP(cons(X0,nil)) ),
inference(destructive_equality_resolution,[status(esa)],[f327]) ).
fof(f523,plain,
( ~ neq(sk2,nil)
| spl0_3 ),
inference(forward_demodulation,[status(thm)],[f438,f465]) ).
fof(f535,plain,
( spl0_12
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f537,plain,
( ~ ssList(nil)
| spl0_12 ),
inference(component_clause,[status(thm)],[f535]) ).
fof(f545,plain,
( $false
| spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f537,f211]) ).
fof(f546,plain,
spl0_12,
inference(contradiction_clause,[status(thm)],[f545]) ).
fof(f547,plain,
( cons(sk5,nil) = sk1
| ~ spl0_6 ),
inference(forward_demodulation,[status(thm)],[f439,f476]) ).
fof(f555,plain,
( spl0_15
<=> ssList(sk1) ),
introduced(split_symbol_definition) ).
fof(f558,plain,
( ~ ssItem(sk5)
| ~ ssList(nil)
| ssList(sk1)
| ~ spl0_6 ),
inference(paramodulation,[status(thm)],[f547,f290]) ).
fof(f559,plain,
( ~ spl0_4
| ~ spl0_12
| spl0_15
| ~ spl0_6 ),
inference(split_clause,[status(thm)],[f558,f467,f535,f555,f475]) ).
fof(f615,plain,
( spl0_19
<=> singletonP(cons(sk5,nil)) ),
introduced(split_symbol_definition) ).
fof(f616,plain,
( singletonP(cons(sk5,nil))
| ~ spl0_19 ),
inference(component_clause,[status(thm)],[f615]) ).
fof(f620,plain,
( singletonP(sk1)
| ~ spl0_6
| ~ spl0_19 ),
inference(forward_demodulation,[status(thm)],[f547,f616]) ).
fof(f621,plain,
( $false
| spl0_8
| ~ spl0_6
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[status(thm)],[f620,f485]) ).
fof(f622,plain,
( spl0_8
| ~ spl0_6
| ~ spl0_19 ),
inference(contradiction_clause,[status(thm)],[f621]) ).
fof(f664,plain,
( ~ ssItem(sk5)
| ~ ssList(sk1)
| singletonP(cons(sk5,nil))
| ~ spl0_6 ),
inference(paramodulation,[status(thm)],[f547,f501]) ).
fof(f665,plain,
( ~ spl0_4
| ~ spl0_15
| spl0_19
| ~ spl0_6 ),
inference(split_clause,[status(thm)],[f664,f467,f555,f615,f475]) ).
fof(f667,plain,
( $false
| ~ spl0_2
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f523,f460]) ).
fof(f668,plain,
( ~ spl0_2
| spl0_3 ),
inference(contradiction_clause,[status(thm)],[f667]) ).
fof(f669,plain,
$false,
inference(sat_refutation,[status(thm)],[f462,f487,f489,f491,f546,f559,f622,f665,f668]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWC254-1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.30 % Computer : n015.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 : 300
% 0.10/0.30 % DateTime : Tue May 30 11:38:49 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.32 % Drodi V3.5.1
% 0.15/0.32 % Refutation found
% 0.15/0.32 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.32 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.57 % Elapsed time: 0.042037 seconds
% 0.17/0.57 % CPU time: 0.021713 seconds
% 0.17/0.57 % Memory used: 4.139 MB
%------------------------------------------------------------------------------