TSTP Solution File: CAT018-4 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : CAT018-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n003.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:22 EDT 2024
% Result : Unsatisfiable 0.15s 0.35s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 19 unt; 0 def)
% Number of atoms : 71 ( 20 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 53 ( 26 ~; 24 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 29 !; 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(f8,axiom,
! [X,Y] :
( ~ there_exists(domain(X))
| domain(X) != codomain(Y)
| there_exists(compose(X,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(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,hypothesis,
there_exists(compose(b,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,negated_conjecture,
~ there_exists(compose(a,compose(b,c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f20,plain,
! [X0] :
( ~ there_exists(codomain(X0))
| there_exists(X0) ),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f21,plain,
! [X] :
( ! [Y] : ~ there_exists(compose(X,Y))
| there_exists(domain(X)) ),
inference(miniscoping,[status(esa)],[f6]) ).
fof(f22,plain,
! [X0,X1] :
( ~ there_exists(compose(X0,X1))
| there_exists(domain(X0)) ),
inference(cnf_transformation,[status(esa)],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ~ there_exists(compose(X0,X1))
| domain(X0) = codomain(X1) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f24,plain,
! [X0,X1] :
( ~ there_exists(domain(X0))
| domain(X0) != codomain(X1)
| there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f25,plain,
! [X0,X1,X2] : compose(X0,compose(X1,X2)) = compose(compose(X0,X1),X2),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f27,plain,
! [X0] : compose(codomain(X0),X0) = X0,
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f28,plain,
there_exists(compose(a,b)),
inference(cnf_transformation,[status(esa)],[f12]) ).
fof(f29,plain,
there_exists(compose(b,c)),
inference(cnf_transformation,[status(esa)],[f13]) ).
fof(f30,plain,
~ there_exists(compose(a,compose(b,c))),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f136,plain,
! [X0,X1] : compose(codomain(X0),compose(X0,X1)) = compose(X0,X1),
inference(paramodulation,[status(thm)],[f27,f25]) ).
fof(f138,plain,
there_exists(domain(a)),
inference(resolution,[status(thm)],[f22,f28]) ).
fof(f166,plain,
domain(a) = codomain(b),
inference(resolution,[status(thm)],[f23,f28]) ).
fof(f177,plain,
! [X0] :
( domain(a) != codomain(X0)
| there_exists(compose(a,X0)) ),
inference(resolution,[status(thm)],[f24,f138]) ).
fof(f205,plain,
! [X0,X1] :
( ~ there_exists(compose(X0,X1))
| domain(codomain(X0)) = codomain(compose(X0,X1)) ),
inference(paramodulation,[status(thm)],[f136,f23]) ).
fof(f258,plain,
( spl0_2
<=> there_exists(domain(a)) ),
introduced(split_symbol_definition) ).
fof(f260,plain,
( ~ there_exists(domain(a))
| spl0_2 ),
inference(component_clause,[status(thm)],[f258]) ).
fof(f261,plain,
( spl0_3
<=> there_exists(b) ),
introduced(split_symbol_definition) ).
fof(f264,plain,
( ~ there_exists(domain(a))
| there_exists(b) ),
inference(paramodulation,[status(thm)],[f166,f20]) ).
fof(f265,plain,
( ~ spl0_2
| spl0_3 ),
inference(split_clause,[status(thm)],[f264,f258,f261]) ).
fof(f266,plain,
compose(domain(a),b) = b,
inference(paramodulation,[status(thm)],[f166,f27]) ).
fof(f267,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f260,f138]) ).
fof(f268,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f267]) ).
fof(f483,plain,
( spl0_6
<=> domain(domain(a)) = codomain(b) ),
introduced(split_symbol_definition) ).
fof(f484,plain,
( domain(domain(a)) = codomain(b)
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f483]) ).
fof(f486,plain,
( ~ there_exists(b)
| domain(domain(a)) = codomain(b) ),
inference(paramodulation,[status(thm)],[f266,f23]) ).
fof(f487,plain,
( ~ spl0_3
| spl0_6 ),
inference(split_clause,[status(thm)],[f486,f261,f483]) ).
fof(f495,plain,
( domain(domain(a)) = domain(a)
| ~ spl0_6 ),
inference(forward_demodulation,[status(thm)],[f166,f484]) ).
fof(f1814,plain,
domain(codomain(b)) = codomain(compose(b,c)),
inference(resolution,[status(thm)],[f205,f29]) ).
fof(f1815,plain,
domain(domain(a)) = codomain(compose(b,c)),
inference(forward_demodulation,[status(thm)],[f166,f1814]) ).
fof(f1816,plain,
( domain(a) = codomain(compose(b,c))
| ~ spl0_6 ),
inference(forward_demodulation,[status(thm)],[f495,f1815]) ).
fof(f1874,plain,
( there_exists(compose(a,compose(b,c)))
| ~ spl0_6 ),
inference(resolution,[status(thm)],[f1816,f177]) ).
fof(f1875,plain,
( $false
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f1874,f30]) ).
fof(f1876,plain,
~ spl0_6,
inference(contradiction_clause,[status(thm)],[f1875]) ).
fof(f1877,plain,
$false,
inference(sat_refutation,[status(thm)],[f265,f268,f487,f1876]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : CAT018-4 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n003.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Apr 29 22:19:48 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.31 % Drodi V3.6.0
% 0.15/0.35 % Refutation found
% 0.15/0.35 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.36 % Elapsed time: 0.056380 seconds
% 0.15/0.36 % CPU time: 0.283521 seconds
% 0.15/0.36 % Total memory used: 43.060 MB
% 0.15/0.36 % Net memory used: 42.645 MB
%------------------------------------------------------------------------------