TSTP Solution File: CAT005-3 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : CAT005-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n025.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:17 EDT 2024
% Result : Unsatisfiable 0.11s 0.33s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 43 ( 11 unt; 0 def)
% Number of atoms : 79 ( 17 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 69 ( 33 ~; 31 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X] :
( ~ there_exists(domain(X))
| there_exists(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
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(f11,axiom,
! [X] : compose(codomain(X),X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,hypothesis,
there_exists(compose(a,d)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,hypothesis,
! [X] :
( ~ there_exists(compose(X,d))
| compose(X,d) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f21,negated_conjecture,
domain(a) != d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f26,plain,
! [X0] :
( ~ there_exists(domain(X0))
| there_exists(X0) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f27,plain,
! [X0] :
( ~ there_exists(codomain(X0))
| there_exists(X0) ),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f28,plain,
! [X] :
( ! [Y] : ~ there_exists(compose(X,Y))
| there_exists(domain(X)) ),
inference(miniscoping,[status(esa)],[f6]) ).
fof(f29,plain,
! [X0,X1] :
( ~ there_exists(compose(X0,X1))
| there_exists(domain(X0)) ),
inference(cnf_transformation,[status(esa)],[f28]) ).
fof(f30,plain,
! [X0,X1] :
( ~ there_exists(compose(X0,X1))
| domain(X0) = codomain(X1) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f34,plain,
! [X0] : compose(codomain(X0),X0) = X0,
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f43,plain,
there_exists(compose(a,d)),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f44,plain,
! [X0] :
( ~ there_exists(compose(X0,d))
| compose(X0,d) = X0 ),
inference(cnf_transformation,[status(esa)],[f19]) ).
fof(f46,plain,
domain(a) != d,
inference(cnf_transformation,[status(esa)],[f21]) ).
fof(f50,plain,
there_exists(domain(a)),
inference(resolution,[status(thm)],[f29,f43]) ).
fof(f52,plain,
compose(a,d) = a,
inference(resolution,[status(thm)],[f44,f43]) ).
fof(f53,plain,
there_exists(a),
inference(resolution,[status(thm)],[f50,f26]) ).
fof(f58,plain,
( spl0_0
<=> there_exists(a) ),
introduced(split_symbol_definition) ).
fof(f60,plain,
( ~ there_exists(a)
| spl0_0 ),
inference(component_clause,[status(thm)],[f58]) ).
fof(f66,plain,
( spl0_2
<=> there_exists(domain(a)) ),
introduced(split_symbol_definition) ).
fof(f69,plain,
( ~ there_exists(a)
| there_exists(domain(a)) ),
inference(paramodulation,[status(thm)],[f52,f29]) ).
fof(f70,plain,
( ~ spl0_0
| spl0_2 ),
inference(split_clause,[status(thm)],[f69,f58,f66]) ).
fof(f71,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f60,f53]) ).
fof(f72,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f71]) ).
fof(f80,plain,
( spl0_3
<=> there_exists(d) ),
introduced(split_symbol_definition) ).
fof(f103,plain,
( spl0_5
<=> compose(codomain(d),d) = codomain(d) ),
introduced(split_symbol_definition) ).
fof(f104,plain,
( compose(codomain(d),d) = codomain(d)
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f103]) ).
fof(f106,plain,
( ~ there_exists(d)
| compose(codomain(d),d) = codomain(d) ),
inference(paramodulation,[status(thm)],[f34,f44]) ).
fof(f107,plain,
( ~ spl0_3
| spl0_5 ),
inference(split_clause,[status(thm)],[f106,f80,f103]) ).
fof(f140,plain,
( spl0_6
<=> domain(a) = codomain(d) ),
introduced(split_symbol_definition) ).
fof(f141,plain,
( domain(a) = codomain(d)
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f140]) ).
fof(f143,plain,
( ~ there_exists(a)
| domain(a) = codomain(d) ),
inference(paramodulation,[status(thm)],[f52,f30]) ).
fof(f144,plain,
( ~ spl0_0
| spl0_6 ),
inference(split_clause,[status(thm)],[f143,f58,f140]) ).
fof(f166,plain,
( ~ there_exists(domain(a))
| there_exists(d)
| ~ spl0_6 ),
inference(paramodulation,[status(thm)],[f141,f27]) ).
fof(f167,plain,
( ~ spl0_2
| spl0_3
| ~ spl0_6 ),
inference(split_clause,[status(thm)],[f166,f66,f80,f140]) ).
fof(f170,plain,
( d = codomain(d)
| ~ spl0_5 ),
inference(forward_demodulation,[status(thm)],[f34,f104]) ).
fof(f171,plain,
( d = domain(a)
| ~ spl0_6
| ~ spl0_5 ),
inference(forward_demodulation,[status(thm)],[f141,f170]) ).
fof(f172,plain,
( $false
| ~ spl0_6
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f171,f46]) ).
fof(f173,plain,
( ~ spl0_6
| ~ spl0_5 ),
inference(contradiction_clause,[status(thm)],[f172]) ).
fof(f174,plain,
$false,
inference(sat_refutation,[status(thm)],[f70,f72,f107,f144,f167,f173]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CAT005-3 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Apr 29 22:31:26 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.33 % Drodi V3.6.0
% 0.11/0.33 % Refutation found
% 0.11/0.33 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.11/0.33 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.34 % Elapsed time: 0.017414 seconds
% 0.11/0.34 % CPU time: 0.029501 seconds
% 0.11/0.34 % Total memory used: 12.961 MB
% 0.11/0.34 % Net memory used: 12.922 MB
%------------------------------------------------------------------------------