TSTP Solution File: SWC286-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC286-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n001.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:54 EDT 2023
% Result : Unsatisfiable 0.16s 0.53s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 55 ( 14 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(f3,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f66,axiom,
! [U] :
( ~ ssItem(U)
| strictorderedP(cons(U,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f191,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f192,negated_conjecture,
~ strictorderedP(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f194,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f198,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f203,plain,
strictorderedP(nil),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f266,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[status(esa)],[f66]) ).
fof(f436,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f437,plain,
~ strictorderedP(sk1),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f439,plain,
( ssItem(sk5)
| nil = sk3 ),
inference(cnf_transformation,[status(esa)],[f194]) ).
fof(f444,plain,
( cons(sk5,nil) = sk3
| nil = sk3 ),
inference(cnf_transformation,[status(esa)],[f198]) ).
fof(f455,plain,
( spl0_2
<=> ssItem(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)],[f439,f455,f462]) ).
fof(f466,plain,
( spl0_5
<=> cons(sk5,nil) = sk3 ),
introduced(split_symbol_definition) ).
fof(f467,plain,
( cons(sk5,nil) = sk3
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f466]) ).
fof(f478,plain,
( spl0_5
| spl0_4 ),
inference(split_clause,[status(thm)],[f444,f466,f462]) ).
fof(f530,plain,
( cons(sk5,nil) = sk1
| ~ spl0_5 ),
inference(forward_demodulation,[status(thm)],[f436,f467]) ).
fof(f531,plain,
( nil = sk1
| ~ spl0_4 ),
inference(forward_demodulation,[status(thm)],[f436,f463]) ).
fof(f532,plain,
( ~ strictorderedP(nil)
| ~ spl0_4 ),
inference(backward_demodulation,[status(thm)],[f531,f437]) ).
fof(f533,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f532,f203]) ).
fof(f534,plain,
~ spl0_4,
inference(contradiction_clause,[status(thm)],[f533]) ).
fof(f543,plain,
( spl0_12
<=> strictorderedP(sk1) ),
introduced(split_symbol_definition) ).
fof(f544,plain,
( strictorderedP(sk1)
| ~ spl0_12 ),
inference(component_clause,[status(thm)],[f543]) ).
fof(f546,plain,
( ~ ssItem(sk5)
| strictorderedP(sk1)
| ~ spl0_5 ),
inference(paramodulation,[status(thm)],[f530,f266]) ).
fof(f547,plain,
( ~ spl0_2
| spl0_12
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f546,f455,f543,f466]) ).
fof(f610,plain,
( $false
| ~ spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f437,f544]) ).
fof(f611,plain,
~ spl0_12,
inference(contradiction_clause,[status(thm)],[f610]) ).
fof(f612,plain,
$false,
inference(sat_refutation,[status(thm)],[f465,f478,f534,f547,f611]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWC286-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 : n001.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:52:45 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.10/0.31 % Drodi V3.5.1
% 0.16/0.53 % Refutation found
% 0.16/0.53 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.16/0.53 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.53 % Elapsed time: 0.016849 seconds
% 0.16/0.53 % CPU time: 0.019243 seconds
% 0.16/0.53 % Memory used: 4.101 MB
%------------------------------------------------------------------------------