TSTP Solution File: CAT010-4 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : CAT010-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n019.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:07 EDT 2023
% Result : Unsatisfiable 0.19s 0.60s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 36 ( 19 unt; 7 typ; 0 def)
% Number of atoms : 39 ( 20 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 2 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
equivalent: ( $i * $i ) > $o ).
tff(decl_23,type,
there_exists: $i > $o ).
tff(decl_24,type,
domain: $i > $i ).
tff(decl_25,type,
codomain: $i > $i ).
tff(decl_26,type,
compose: ( $i * $i ) > $i ).
tff(decl_27,type,
a: $i ).
tff(decl_28,type,
b: $i ).
cnf(domain_codomain_composition1,axiom,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',domain_codomain_composition1) ).
cnf(ab_exists,hypothesis,
there_exists(compose(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ab_exists) ).
cnf(composition_implies_domain,axiom,
( there_exists(domain(X1))
| ~ there_exists(compose(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',composition_implies_domain) ).
cnf(compose_codomain,axiom,
compose(codomain(X1),X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',compose_codomain) ).
cnf(domain_has_elements,axiom,
( there_exists(X1)
| ~ there_exists(domain(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',domain_has_elements) ).
cnf(associativity_of_compose,axiom,
compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',associativity_of_compose) ).
cnf(compose_domain,axiom,
compose(X1,domain(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',compose_domain) ).
cnf(prove_codomain_of_ab_equals_codomain_of_a,negated_conjecture,
codomain(compose(a,b)) != codomain(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_of_ab_equals_codomain_of_a) ).
cnf(c_0_8,axiom,
( domain(X1) = codomain(X2)
| ~ there_exists(compose(X1,X2)) ),
domain_codomain_composition1 ).
cnf(c_0_9,hypothesis,
there_exists(compose(a,b)),
ab_exists ).
cnf(c_0_10,axiom,
( there_exists(domain(X1))
| ~ there_exists(compose(X1,X2)) ),
composition_implies_domain ).
cnf(c_0_11,hypothesis,
domain(a) = codomain(b),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
compose(codomain(X1),X1) = X1,
compose_codomain ).
cnf(c_0_13,axiom,
( there_exists(X1)
| ~ there_exists(domain(X1)) ),
domain_has_elements ).
cnf(c_0_14,hypothesis,
there_exists(codomain(b)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_11]) ).
cnf(c_0_15,axiom,
compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
associativity_of_compose ).
cnf(c_0_16,axiom,
compose(X1,domain(X1)) = X1,
compose_domain ).
cnf(c_0_17,plain,
( domain(codomain(X1)) = codomain(X1)
| ~ there_exists(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_18,hypothesis,
there_exists(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_11]),c_0_14])]) ).
cnf(c_0_19,plain,
compose(X1,compose(domain(X1),X2)) = compose(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,hypothesis,
domain(codomain(a)) = codomain(a),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( codomain(X1) = domain(compose(X2,X3))
| ~ there_exists(compose(X2,compose(X3,X1))) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_22,hypothesis,
compose(codomain(a),compose(codomain(a),X1)) = compose(codomain(a),X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,hypothesis,
compose(codomain(a),codomain(a)) = codomain(a),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_24,hypothesis,
( codomain(X1) = codomain(a)
| ~ there_exists(compose(codomain(a),X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_20]) ).
cnf(c_0_25,plain,
compose(codomain(X1),compose(X1,X2)) = compose(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_26,hypothesis,
( codomain(compose(a,X1)) = codomain(a)
| ~ there_exists(compose(a,X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
codomain(compose(a,b)) != codomain(a),
prove_codomain_of_ab_equals_codomain_of_a ).
cnf(c_0_28,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_9]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CAT010-4 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Aug 27 00:19:58 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.58 start to proof: theBenchmark
% 0.19/0.60 % Version : CSE_E---1.5
% 0.19/0.60 % Problem : theBenchmark.p
% 0.19/0.60 % Proof found
% 0.19/0.60 % SZS status Theorem for theBenchmark.p
% 0.19/0.60 % SZS output start Proof
% See solution above
% 0.19/0.60 % Total time : 0.012000 s
% 0.19/0.60 % SZS output end Proof
% 0.19/0.60 % Total time : 0.014000 s
%------------------------------------------------------------------------------