TSTP Solution File: CAT007-3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : CAT007-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n005.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 Aug 30 18:14:06 EDT 2023
% Result : Unsatisfiable 0.16s 0.55s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 12
% Syntax : Number of formulae : 17 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 13 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 6 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
equalish: ( $i * $i ) > $o ).
tff(decl_23,type,
domain: $i > $i ).
tff(decl_24,type,
there_exists: $i > $o ).
tff(decl_25,type,
codomain: $i > $i ).
tff(decl_26,type,
compose: ( $i * $i ) > $i ).
tff(decl_27,type,
f1: ( $i * $i ) > $i ).
tff(decl_28,type,
c2: $i ).
tff(decl_29,type,
c1: $i ).
cnf(domain_codomain_composition2,axiom,
( there_exists(compose(X1,X2))
| ~ there_exists(domain(X1))
| ~ equalish(domain(X1),codomain(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain_codomain_composition2) ).
cnf(domain_of_c2_equals_codomain_of_c1,hypothesis,
equalish(domain(c2),codomain(c1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain_of_c2_equals_codomain_of_c1) ).
cnf(domain_of_c2_exists,hypothesis,
there_exists(domain(c2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain_of_c2_exists) ).
cnf(prove_c1_c2_is_defined,negated_conjecture,
~ there_exists(compose(c2,c1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c1_c2_is_defined) ).
cnf(c_0_4,axiom,
( there_exists(compose(X1,X2))
| ~ there_exists(domain(X1))
| ~ equalish(domain(X1),codomain(X2)) ),
domain_codomain_composition2 ).
cnf(c_0_5,hypothesis,
equalish(domain(c2),codomain(c1)),
domain_of_c2_equals_codomain_of_c1 ).
cnf(c_0_6,hypothesis,
there_exists(domain(c2)),
domain_of_c2_exists ).
cnf(c_0_7,negated_conjecture,
~ there_exists(compose(c2,c1)),
prove_c1_c2_is_defined ).
cnf(c_0_8,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6])]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : CAT007-3 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.10/0.32 % Computer : n005.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 : Sun Aug 27 00:06:23 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.54 start to proof: theBenchmark
% 0.16/0.55 % Version : CSE_E---1.5
% 0.16/0.55 % Problem : theBenchmark.p
% 0.16/0.55 % Proof found
% 0.16/0.55 % SZS status Theorem for theBenchmark.p
% 0.16/0.55 % SZS output start Proof
% See solution above
% 0.16/0.55 % Total time : 0.003000 s
% 0.16/0.55 % SZS output end Proof
% 0.16/0.55 % Total time : 0.005000 s
%------------------------------------------------------------------------------