TSTP Solution File: SWC259-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC259-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n005.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:45:07 EDT 2024
% Result : Unsatisfiable 0.15s 0.33s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 55 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 19 ~; 20 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 2 ( 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f67,axiom,
! [U] :
( ~ ssItem(U)
| totalorderedP(cons(U,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f191,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f192,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f194,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f203,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f210,plain,
totalorderedP(nil),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f273,plain,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[status(esa)],[f67]) ).
fof(f442,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f443,plain,
~ totalorderedP(sk1),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f445,plain,
( ssItem(sk5)
| nil = sk3 ),
inference(cnf_transformation,[status(esa)],[f194]) ).
fof(f456,plain,
( cons(sk5,nil) = sk3
| nil = sk3 ),
inference(cnf_transformation,[status(esa)],[f203]) ).
fof(f469,plain,
( spl0_2
<=> ssItem(sk5) ),
introduced(split_symbol_definition) ).
fof(f476,plain,
( spl0_4
<=> nil = sk3 ),
introduced(split_symbol_definition) ).
fof(f477,plain,
( nil = sk3
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f476]) ).
fof(f479,plain,
( spl0_2
| spl0_4 ),
inference(split_clause,[status(thm)],[f445,f469,f476]) ).
fof(f488,plain,
( spl0_7
<=> cons(sk5,nil) = sk3 ),
introduced(split_symbol_definition) ).
fof(f489,plain,
( cons(sk5,nil) = sk3
| ~ spl0_7 ),
inference(component_clause,[status(thm)],[f488]) ).
fof(f506,plain,
( spl0_7
| spl0_4 ),
inference(split_clause,[status(thm)],[f456,f488,f476]) ).
fof(f562,plain,
( nil = sk1
| ~ spl0_4 ),
inference(forward_demodulation,[status(thm)],[f442,f477]) ).
fof(f565,plain,
( ~ totalorderedP(nil)
| ~ spl0_4 ),
inference(backward_demodulation,[status(thm)],[f562,f443]) ).
fof(f566,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f565,f210]) ).
fof(f567,plain,
~ spl0_4,
inference(contradiction_clause,[status(thm)],[f566]) ).
fof(f574,plain,
( spl0_11
<=> totalorderedP(sk3) ),
introduced(split_symbol_definition) ).
fof(f575,plain,
( totalorderedP(sk3)
| ~ spl0_11 ),
inference(component_clause,[status(thm)],[f574]) ).
fof(f577,plain,
( ~ ssItem(sk5)
| totalorderedP(sk3)
| ~ spl0_7 ),
inference(paramodulation,[status(thm)],[f489,f273]) ).
fof(f578,plain,
( ~ spl0_2
| spl0_11
| ~ spl0_7 ),
inference(split_clause,[status(thm)],[f577,f469,f574,f488]) ).
fof(f589,plain,
( totalorderedP(sk1)
| ~ spl0_11 ),
inference(backward_demodulation,[status(thm)],[f442,f575]) ).
fof(f590,plain,
( $false
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[status(thm)],[f589,f443]) ).
fof(f591,plain,
~ spl0_11,
inference(contradiction_clause,[status(thm)],[f590]) ).
fof(f592,plain,
$false,
inference(sat_refutation,[status(thm)],[f479,f506,f567,f578,f591]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWC259-1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.31 % Computer : n005.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 300
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Mon Apr 29 23:59:56 EDT 2024
% 0.09/0.31 % CPUTime :
% 0.15/0.32 % Drodi V3.6.0
% 0.15/0.33 % Refutation found
% 0.15/0.33 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.33 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.34 % Elapsed time: 0.024027 seconds
% 0.15/0.34 % CPU time: 0.037127 seconds
% 0.15/0.34 % Total memory used: 14.461 MB
% 0.15/0.34 % Net memory used: 14.437 MB
%------------------------------------------------------------------------------