TSTP Solution File: LAT038-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LAT038-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n013.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 05:59:18 EDT 2023
% Result : Unsatisfiable 0.20s 0.71s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of formulae : 44 ( 36 unt; 8 typ; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 47 ( 7 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
meet: ( $i * $i ) > $i ).
tff(decl_23,type,
join: ( $i * $i ) > $i ).
tff(decl_24,type,
f: ( $i * $i ) > $i ).
tff(decl_25,type,
n0: $i ).
tff(decl_26,type,
aa: $i ).
tff(decl_27,type,
bb: $i ).
tff(decl_28,type,
dd: $i ).
tff(decl_29,type,
cc: $i ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(lhs2,hypothesis,
meet(f(aa,dd),f(bb,dd)) = meet(f(cc,dd),f(bb,dd)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lhs2) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(dist_meet,hypothesis,
meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dist_meet) ).
cnf(lhs1,hypothesis,
f(join(aa,bb),dd) = f(join(cc,bb),dd),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lhs1) ).
cnf(f_on_left_join,axiom,
f(join(X1,X2),X3) = join(f(X1,X3),f(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f_on_left_join) ).
cnf(rhs,negated_conjecture,
f(aa,dd) != f(cc,dd),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rhs) ).
cnf(c_0_10,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_11,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_12,hypothesis,
meet(f(aa,dd),f(bb,dd)) = meet(f(cc,dd),f(bb,dd)),
lhs2 ).
cnf(c_0_13,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_14,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_15,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,hypothesis,
meet(f(bb,dd),f(aa,dd)) = meet(f(bb,dd),f(cc,dd)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11]),c_0_11]) ).
cnf(c_0_17,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,hypothesis,
join(f(aa,dd),meet(f(bb,dd),f(cc,dd))) = f(aa,dd),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_20,hypothesis,
meet(f(bb,dd),meet(f(cc,dd),f(aa,dd))) = meet(f(bb,dd),f(cc,dd)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_21,hypothesis,
meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
dist_meet ).
cnf(c_0_22,hypothesis,
f(join(aa,bb),dd) = f(join(cc,bb),dd),
lhs1 ).
cnf(c_0_23,hypothesis,
join(meet(f(bb,dd),f(cc,dd)),meet(f(cc,dd),f(aa,dd))) = meet(f(cc,dd),f(aa,dd)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_14]) ).
cnf(c_0_24,hypothesis,
join(meet(X1,X2),meet(X2,X3)) = meet(X2,join(X1,X3)),
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_25,axiom,
f(join(X1,X2),X3) = join(f(X1,X3),f(X2,X3)),
f_on_left_join ).
cnf(c_0_26,hypothesis,
f(join(bb,aa),dd) = f(join(bb,cc),dd),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_14]),c_0_14]) ).
cnf(c_0_27,hypothesis,
meet(f(cc,dd),f(join(bb,cc),dd)) = meet(f(cc,dd),f(aa,dd)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_28,plain,
meet(f(X1,X2),f(join(X3,X1),X2)) = f(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_29,hypothesis,
meet(f(cc,dd),f(aa,dd)) = f(cc,dd),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,hypothesis,
meet(f(aa,dd),join(f(cc,dd),X1)) = join(f(cc,dd),meet(f(aa,dd),X1)),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_31,hypothesis,
join(f(cc,dd),meet(f(aa,dd),f(X1,dd))) = meet(f(aa,dd),f(join(cc,X1),dd)),
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
cnf(c_0_32,hypothesis,
join(f(cc,dd),meet(f(X1,dd),f(aa,dd))) = meet(f(aa,dd),f(join(cc,X1),dd)),
inference(spm,[status(thm)],[c_0_31,c_0_11]) ).
cnf(c_0_33,hypothesis,
meet(f(aa,dd),f(join(bb,cc),dd)) = f(aa,dd),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_34,negated_conjecture,
f(aa,dd) != f(cc,dd),
rhs ).
cnf(c_0_35,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_16]),c_0_15]),c_0_14]),c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT038-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 24 06:57:17 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.71 % Version : CSE_E---1.5
% 0.20/0.71 % Problem : theBenchmark.p
% 0.20/0.71 % Proof found
% 0.20/0.71 % SZS status Theorem for theBenchmark.p
% 0.20/0.71 % SZS output start Proof
% See solution above
% 0.20/0.72 % Total time : 0.132000 s
% 0.20/0.72 % SZS output end Proof
% 0.20/0.72 % Total time : 0.135000 s
%------------------------------------------------------------------------------