TSTP Solution File: REL024-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : REL024-2 : 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 : n026.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:36:04 EDT 2023
% Result : Unsatisfiable 0.20s 0.68s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 24
% Syntax : Number of formulae : 62 ( 51 unt; 11 typ; 0 def)
% Number of atoms : 51 ( 50 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 7 ( 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 : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 76 ( 2 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 ).
tff(decl_31,type,
sk2: $i ).
tff(decl_32,type,
sk3: $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(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_identity_6) ).
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(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(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(goals_17,negated_conjecture,
join(composition(meet(sk1,converse(sk2)),meet(sk2,sk3)),composition(meet(sk1,converse(sk2)),sk3)) != composition(meet(sk1,converse(sk2)),sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_17) ).
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(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(c_0_13,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_14,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_15,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_17,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14]) ).
cnf(c_0_18,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_19,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_20,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_22,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_23,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_25,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_27,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20]),c_0_24]) ).
cnf(c_0_28,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_30,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_31,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_33,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,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_32,c_0_26]),c_0_27]),c_0_28]),c_0_19]) ).
cnf(c_0_35,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_36]) ).
cnf(c_0_38,negated_conjecture,
join(composition(meet(sk1,converse(sk2)),meet(sk2,sk3)),composition(meet(sk1,converse(sk2)),sk3)) != composition(meet(sk1,converse(sk2)),sk3),
goals_17 ).
cnf(c_0_39,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_40,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_41,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
join(composition(complement(join(complement(sk1),complement(converse(sk2)))),complement(join(complement(sk2),complement(sk3)))),composition(complement(join(complement(sk1),complement(converse(sk2)))),sk3)) != composition(complement(join(complement(sk1),complement(converse(sk2)))),sk3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_22]),c_0_22]),c_0_22]),c_0_22]) ).
cnf(c_0_43,plain,
converse(join(composition(converse(X1),X2),X3)) = join(composition(converse(X2),X1),converse(X3)),
inference(spm,[status(thm)],[c_0_39,c_0_15]) ).
cnf(c_0_44,plain,
join(composition(X1,converse(X2)),converse(composition(X2,X3))) = composition(join(X1,converse(X3)),converse(X2)),
inference(spm,[status(thm)],[c_0_40,c_0_13]) ).
cnf(c_0_45,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_32]),c_0_19]) ).
cnf(c_0_46,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_41,c_0_19]) ).
cnf(c_0_47,negated_conjecture,
join(composition(complement(join(complement(sk1),complement(converse(sk2)))),sk3),composition(complement(join(complement(sk1),complement(converse(sk2)))),complement(join(complement(sk2),complement(sk3))))) != composition(complement(join(complement(sk1),complement(converse(sk2)))),sk3),
inference(rw,[status(thm)],[c_0_42,c_0_19]) ).
cnf(c_0_48,plain,
join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
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_43,c_0_44]),c_0_39]),c_0_13]),c_0_14]),c_0_14]),c_0_14]) ).
cnf(c_0_49,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : REL024-2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 25 20:15:18 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.68 % Version : CSE_E---1.5
% 0.20/0.68 % Problem : theBenchmark.p
% 0.20/0.68 % Proof found
% 0.20/0.68 % SZS status Theorem for theBenchmark.p
% 0.20/0.68 % SZS output start Proof
% See solution above
% 0.20/0.69 % Total time : 0.091000 s
% 0.20/0.69 % SZS output end Proof
% 0.20/0.69 % Total time : 0.094000 s
%------------------------------------------------------------------------------