TSTP Solution File: CAT005-4 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : CAT005-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n021.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.15s 0.31s
% Output : CNFRefutation 0.15s
% 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/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X] :
( ~ there_exists(codomain(X))
| there_exists(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X,Y] :
( ~ there_exists(compose(X,Y))
| there_exists(domain(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y] :
( ~ there_exists(compose(X,Y))
| domain(X) = codomain(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X] : compose(codomain(X),X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,hypothesis,
there_exists(compose(a,d)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f13,hypothesis,
! [X] :
( ~ there_exists(compose(X,d))
| compose(X,d) = X ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,negated_conjecture,
domain(a) != d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,plain,
! [X0] :
( ~ there_exists(domain(X0))
| there_exists(X0) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f21,plain,
! [X0] :
( ~ there_exists(codomain(X0))
| there_exists(X0) ),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f22,plain,
! [X] :
( ! [Y] : ~ there_exists(compose(X,Y))
| there_exists(domain(X)) ),
inference(miniscoping,[status(esa)],[f6]) ).
fof(f23,plain,
! [X0,X1] :
( ~ there_exists(compose(X0,X1))
| there_exists(domain(X0)) ),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( ~ there_exists(compose(X0,X1))
| domain(X0) = codomain(X1) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f28,plain,
! [X0] : compose(codomain(X0),X0) = X0,
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f29,plain,
there_exists(compose(a,d)),
inference(cnf_transformation,[status(esa)],[f12]) ).
fof(f30,plain,
! [X0] :
( ~ there_exists(compose(X0,d))
| compose(X0,d) = X0 ),
inference(cnf_transformation,[status(esa)],[f13]) ).
fof(f32,plain,
domain(a) != d,
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f34,plain,
there_exists(domain(a)),
inference(resolution,[status(thm)],[f23,f29]) ).
fof(f36,plain,
compose(a,d) = a,
inference(resolution,[status(thm)],[f30,f29]) ).
fof(f37,plain,
there_exists(a),
inference(resolution,[status(thm)],[f34,f20]) ).
fof(f42,plain,
( spl0_0
<=> there_exists(a) ),
introduced(split_symbol_definition) ).
fof(f44,plain,
( ~ there_exists(a)
| spl0_0 ),
inference(component_clause,[status(thm)],[f42]) ).
fof(f50,plain,
( spl0_2
<=> there_exists(domain(a)) ),
introduced(split_symbol_definition) ).
fof(f53,plain,
( ~ there_exists(a)
| there_exists(domain(a)) ),
inference(paramodulation,[status(thm)],[f36,f23]) ).
fof(f54,plain,
( ~ spl0_0
| spl0_2 ),
inference(split_clause,[status(thm)],[f53,f42,f50]) ).
fof(f55,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f44,f37]) ).
fof(f56,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f55]) ).
fof(f64,plain,
( spl0_3
<=> there_exists(d) ),
introduced(split_symbol_definition) ).
fof(f84,plain,
( spl0_5
<=> compose(codomain(d),d) = codomain(d) ),
introduced(split_symbol_definition) ).
fof(f85,plain,
( compose(codomain(d),d) = codomain(d)
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f84]) ).
fof(f87,plain,
( ~ there_exists(d)
| compose(codomain(d),d) = codomain(d) ),
inference(paramodulation,[status(thm)],[f28,f30]) ).
fof(f88,plain,
( ~ spl0_3
| spl0_5 ),
inference(split_clause,[status(thm)],[f87,f64,f84]) ).
fof(f127,plain,
( spl0_6
<=> domain(a) = codomain(d) ),
introduced(split_symbol_definition) ).
fof(f128,plain,
( domain(a) = codomain(d)
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f127]) ).
fof(f130,plain,
( ~ there_exists(a)
| domain(a) = codomain(d) ),
inference(paramodulation,[status(thm)],[f36,f24]) ).
fof(f131,plain,
( ~ spl0_0
| spl0_6 ),
inference(split_clause,[status(thm)],[f130,f42,f127]) ).
fof(f155,plain,
( ~ there_exists(domain(a))
| there_exists(d)
| ~ spl0_6 ),
inference(paramodulation,[status(thm)],[f128,f21]) ).
fof(f156,plain,
( ~ spl0_2
| spl0_3
| ~ spl0_6 ),
inference(split_clause,[status(thm)],[f155,f50,f64,f127]) ).
fof(f159,plain,
( d = codomain(d)
| ~ spl0_5 ),
inference(forward_demodulation,[status(thm)],[f28,f85]) ).
fof(f160,plain,
( d = domain(a)
| ~ spl0_6
| ~ spl0_5 ),
inference(forward_demodulation,[status(thm)],[f128,f159]) ).
fof(f161,plain,
( $false
| ~ spl0_6
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f160,f32]) ).
fof(f162,plain,
( ~ spl0_6
| ~ spl0_5 ),
inference(contradiction_clause,[status(thm)],[f161]) ).
fof(f163,plain,
$false,
inference(sat_refutation,[status(thm)],[f54,f56,f88,f131,f156,f162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.09 % Problem : CAT005-4 : TPTP v8.1.2. Released v1.0.0.
% 0.01/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n021.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:18:10 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.31 % Drodi V3.6.0
% 0.15/0.31 % Refutation found
% 0.15/0.31 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.32 % Elapsed time: 0.015385 seconds
% 0.15/0.32 % CPU time: 0.027925 seconds
% 0.15/0.32 % Total memory used: 8.443 MB
% 0.15/0.32 % Net memory used: 8.424 MB
%------------------------------------------------------------------------------