TSTP Solution File: REL013-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : REL013-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n006.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 : Thu Aug 31 13:35:55 EDT 2023
% Result : Unsatisfiable 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 22
% Syntax : Number of formulae : 70 ( 59 unt; 9 typ; 0 def)
% Number of atoms : 63 ( 62 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 73 ( 9 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
join: ( $i * $i ) > $i ).
tff(decl_23,type,
complement: $i > $i ).
tff(decl_24,type,
meet: ( $i * $i ) > $i ).
tff(decl_25,type,
composition: ( $i * $i ) > $i ).
tff(decl_26,type,
one: $i ).
tff(decl_27,type,
converse: $i > $i ).
tff(decl_28,type,
top: $i ).
tff(decl_29,type,
zero: $i ).
tff(decl_30,type,
sk1: $i ).
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_identity_6) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_top_12) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(maddux3_a_kind_of_de_Morgan_3,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux3_a_kind_of_de_Morgan_3) ).
cnf(maddux2_join_associativity_2,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).
cnf(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
cnf(goals_14,negated_conjecture,
( composition(sk1,zero) != zero
| composition(zero,sk1) != zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14) ).
cnf(c_0_13,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_14,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_15,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_17,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_18,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_19,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_22,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_23,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_24,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_25,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_27,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_29,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_30,plain,
join(top,zero) = top,
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_31,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_32,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_24]),c_0_28]) ).
cnf(c_0_33,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_34,plain,
join(top,join(zero,X1)) = join(top,X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_21]),c_0_25]),c_0_23]) ).
cnf(c_0_36,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_32]),c_0_21]) ).
cnf(c_0_37,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_38,plain,
join(top,X1) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_39,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_40,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_32,c_0_25]) ).
cnf(c_0_41,plain,
join(composition(top,X1),composition(X2,X1)) = composition(top,X1),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
join(converse(top),converse(X1)) = converse(top),
inference(spm,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_43,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_29,c_0_40]) ).
cnf(c_0_44,plain,
join(X1,composition(top,X1)) = composition(top,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_28]),c_0_23]) ).
cnf(c_0_45,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_23,c_0_38]) ).
cnf(c_0_46,plain,
join(converse(top),X1) = converse(top),
inference(spm,[status(thm)],[c_0_42,c_0_16]) ).
cnf(c_0_47,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_43,c_0_35]) ).
cnf(c_0_48,plain,
composition(top,top) = top,
inference(spm,[status(thm)],[c_0_38,c_0_44]) ).
cnf(c_0_49,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
join(converse(zero),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_39,c_0_47]) ).
cnf(c_0_51,plain,
composition(top,zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_48]),c_0_25]),c_0_49]),c_0_25]),c_0_44]),c_0_25]) ).
cnf(c_0_52,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_47]) ).
cnf(c_0_53,plain,
join(converse(zero),X1) = X1,
inference(spm,[status(thm)],[c_0_50,c_0_16]) ).
cnf(c_0_54,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_51]),c_0_47]) ).
cnf(c_0_55,plain,
converse(zero) = zero,
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( composition(sk1,zero) != zero
| composition(zero,sk1) != zero ),
goals_14 ).
cnf(c_0_57,plain,
composition(zero,converse(X1)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_54]),c_0_55]),c_0_55]) ).
cnf(c_0_58,negated_conjecture,
composition(zero,sk1) != zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_54])]) ).
cnf(c_0_59,plain,
composition(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_57,c_0_16]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : REL013-1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 25 23:11:07 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.58 % Total time : 0.012000 s
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58 % Total time : 0.015000 s
%------------------------------------------------------------------------------