TSTP Solution File: SWC276-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC276-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n029.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:52 EDT 2023
% Result : Unsatisfiable 0.13s 0.38s
% Output : CNFRefutation 0.13s
% 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(f4,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f67,axiom,
! [U] :
( ~ ssItem(U)
| totalorderedP(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,
~ totalorderedP(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f194,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f197,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f202,plain,
totalorderedP(nil),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f265,plain,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[status(esa)],[f67]) ).
fof(f434,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f435,plain,
~ totalorderedP(sk1),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f437,plain,
( ssItem(sk5)
| nil = sk3 ),
inference(cnf_transformation,[status(esa)],[f194]) ).
fof(f440,plain,
( cons(sk5,nil) = sk3
| nil = sk3 ),
inference(cnf_transformation,[status(esa)],[f197]) ).
fof(f449,plain,
( spl0_2
<=> ssItem(sk5) ),
introduced(split_symbol_definition) ).
fof(f456,plain,
( spl0_4
<=> nil = sk3 ),
introduced(split_symbol_definition) ).
fof(f457,plain,
( nil = sk3
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f456]) ).
fof(f459,plain,
( spl0_2
| spl0_4 ),
inference(split_clause,[status(thm)],[f437,f449,f456]) ).
fof(f460,plain,
( spl0_5
<=> cons(sk5,nil) = sk3 ),
introduced(split_symbol_definition) ).
fof(f461,plain,
( cons(sk5,nil) = sk3
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f460]) ).
fof(f468,plain,
( spl0_5
| spl0_4 ),
inference(split_clause,[status(thm)],[f440,f460,f456]) ).
fof(f518,plain,
( cons(sk5,nil) = sk1
| ~ spl0_5 ),
inference(forward_demodulation,[status(thm)],[f434,f461]) ).
fof(f524,plain,
( nil = sk1
| ~ spl0_4 ),
inference(forward_demodulation,[status(thm)],[f434,f457]) ).
fof(f525,plain,
( ~ totalorderedP(nil)
| ~ spl0_4 ),
inference(backward_demodulation,[status(thm)],[f524,f435]) ).
fof(f526,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f525,f202]) ).
fof(f527,plain,
~ spl0_4,
inference(contradiction_clause,[status(thm)],[f526]) ).
fof(f528,plain,
( spl0_12
<=> totalorderedP(sk1) ),
introduced(split_symbol_definition) ).
fof(f529,plain,
( totalorderedP(sk1)
| ~ spl0_12 ),
inference(component_clause,[status(thm)],[f528]) ).
fof(f531,plain,
( ~ ssItem(sk5)
| totalorderedP(sk1)
| ~ spl0_5 ),
inference(paramodulation,[status(thm)],[f518,f265]) ).
fof(f532,plain,
( ~ spl0_2
| spl0_12
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f531,f449,f528,f460]) ).
fof(f590,plain,
( $false
| ~ spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f435,f529]) ).
fof(f591,plain,
~ spl0_12,
inference(contradiction_clause,[status(thm)],[f590]) ).
fof(f592,plain,
$false,
inference(sat_refutation,[status(thm)],[f459,f468,f527,f532,f591]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC276-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 11:35:07 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.13/0.38 % Refutation found
% 0.13/0.38 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38 % Elapsed time: 0.030109 seconds
% 0.13/0.38 % CPU time: 0.050120 seconds
% 0.13/0.38 % Memory used: 16.039 MB
%------------------------------------------------------------------------------