TSTP Solution File: CAT009-4 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : CAT009-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n018.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:13:19 EDT 2024
% Result : Unsatisfiable 0.10s 0.38s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 15 unt; 0 def)
% Number of atoms : 73 ( 22 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 64 ( 32 ~; 30 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X] :
( ~ there_exists(codomain(X))
| there_exists(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X,Y] :
( ~ there_exists(compose(X,Y))
| there_exists(domain(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y] :
( ~ there_exists(compose(X,Y))
| domain(X) = codomain(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [X,Y,Z] : compose(X,compose(Y,Z)) = compose(compose(X,Y),Z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X] : compose(X,domain(X)) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X] : compose(codomain(X),X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,hypothesis,
there_exists(compose(a,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f13,negated_conjecture,
domain(compose(a,b)) != domain(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,plain,
! [X0] :
( ~ there_exists(codomain(X0))
| there_exists(X0) ),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f20,plain,
! [X] :
( ! [Y] : ~ there_exists(compose(X,Y))
| there_exists(domain(X)) ),
inference(miniscoping,[status(esa)],[f6]) ).
fof(f21,plain,
! [X0,X1] :
( ~ there_exists(compose(X0,X1))
| there_exists(domain(X0)) ),
inference(cnf_transformation,[status(esa)],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( ~ there_exists(compose(X0,X1))
| domain(X0) = codomain(X1) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f24,plain,
! [X0,X1,X2] : compose(X0,compose(X1,X2)) = compose(compose(X0,X1),X2),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f25,plain,
! [X0] : compose(X0,domain(X0)) = X0,
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f26,plain,
! [X0] : compose(codomain(X0),X0) = X0,
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f27,plain,
there_exists(compose(a,b)),
inference(cnf_transformation,[status(esa)],[f12]) ).
fof(f28,plain,
domain(compose(a,b)) != domain(b),
inference(cnf_transformation,[status(esa)],[f13]) ).
fof(f30,plain,
there_exists(domain(a)),
inference(resolution,[status(thm)],[f21,f27]) ).
fof(f131,plain,
domain(a) = codomain(b),
inference(resolution,[status(thm)],[f22,f27]) ).
fof(f133,plain,
! [X0,X1,X2] :
( ~ there_exists(compose(X0,compose(X1,X2)))
| domain(compose(X0,X1)) = codomain(X2) ),
inference(paramodulation,[status(thm)],[f24,f22]) ).
fof(f138,plain,
! [X0] :
( ~ there_exists(X0)
| domain(X0) = codomain(domain(X0)) ),
inference(paramodulation,[status(thm)],[f25,f22]) ).
fof(f254,plain,
( spl0_0
<=> there_exists(domain(a)) ),
introduced(split_symbol_definition) ).
fof(f256,plain,
( ~ there_exists(domain(a))
| spl0_0 ),
inference(component_clause,[status(thm)],[f254]) ).
fof(f257,plain,
( spl0_1
<=> there_exists(b) ),
introduced(split_symbol_definition) ).
fof(f258,plain,
( there_exists(b)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f257]) ).
fof(f260,plain,
( ~ there_exists(domain(a))
| there_exists(b) ),
inference(paramodulation,[status(thm)],[f131,f19]) ).
fof(f261,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f260,f254,f257]) ).
fof(f263,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f256,f30]) ).
fof(f264,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f263]) ).
fof(f291,plain,
( domain(b) = codomain(domain(b))
| ~ spl0_1 ),
inference(resolution,[status(thm)],[f258,f138]) ).
fof(f349,plain,
( compose(domain(b),domain(b)) = domain(b)
| ~ spl0_1 ),
inference(paramodulation,[status(thm)],[f291,f26]) ).
fof(f418,plain,
! [X0] :
( ~ there_exists(compose(X0,domain(b)))
| domain(compose(X0,domain(b))) = codomain(domain(b))
| ~ spl0_1 ),
inference(paramodulation,[status(thm)],[f349,f133]) ).
fof(f419,plain,
! [X0] :
( ~ there_exists(compose(X0,domain(b)))
| domain(compose(X0,domain(b))) = domain(b)
| ~ spl0_1 ),
inference(forward_demodulation,[status(thm)],[f291,f418]) ).
fof(f679,plain,
! [X0,X1] :
( ~ there_exists(compose(X0,compose(X1,domain(b))))
| domain(compose(compose(X0,X1),domain(b))) = domain(b)
| ~ spl0_1 ),
inference(paramodulation,[status(thm)],[f24,f419]) ).
fof(f680,plain,
! [X0,X1] :
( ~ there_exists(compose(X0,compose(X1,domain(b))))
| domain(compose(X0,compose(X1,domain(b)))) = domain(b)
| ~ spl0_1 ),
inference(forward_demodulation,[status(thm)],[f24,f679]) ).
fof(f899,plain,
! [X0] :
( ~ there_exists(compose(X0,b))
| domain(compose(X0,compose(b,domain(b)))) = domain(b)
| ~ spl0_1 ),
inference(paramodulation,[status(thm)],[f25,f680]) ).
fof(f900,plain,
! [X0] :
( ~ there_exists(compose(X0,b))
| domain(compose(X0,b)) = domain(b)
| ~ spl0_1 ),
inference(forward_demodulation,[status(thm)],[f25,f899]) ).
fof(f922,plain,
( domain(compose(a,b)) = domain(b)
| ~ spl0_1 ),
inference(resolution,[status(thm)],[f900,f27]) ).
fof(f923,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f922,f28]) ).
fof(f924,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f923]) ).
fof(f925,plain,
$false,
inference(sat_refutation,[status(thm)],[f261,f264,f924]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : CAT009-4 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.32 % Computer : n018.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Apr 29 22:28:13 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.33 % Drodi V3.6.0
% 0.10/0.38 % Refutation found
% 0.10/0.38 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.39 % Elapsed time: 0.063094 seconds
% 0.10/0.39 % CPU time: 0.380526 seconds
% 0.10/0.39 % Total memory used: 47.474 MB
% 0.10/0.39 % Net memory used: 46.974 MB
%------------------------------------------------------------------------------