TSTP Solution File: LAT006-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LAT006-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n023.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:06 EDT 2023
% Result : Unsatisfiable 0.47s 0.63s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 34 unt; 5 typ; 0 def)
% Number of atoms : 34 ( 33 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 75 ( 9 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
join: ( $i * $i ) > $i ).
tff(decl_23,type,
meet: ( $i * $i ) > $i ).
tff(decl_24,type,
a: $i ).
tff(decl_25,type,
b: $i ).
tff(decl_26,type,
c: $i ).
cnf(absorption,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',absorption) ).
cnf(distribution,axiom,
meet(X1,join(X2,X3)) = join(meet(X3,X1),meet(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distribution) ).
cnf(prove_associativity_of_meet,negated_conjecture,
meet(meet(a,b),c) != meet(a,meet(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_associativity_of_meet) ).
cnf(c_0_3,axiom,
meet(X1,join(X1,X2)) = X1,
absorption ).
cnf(c_0_4,axiom,
meet(X1,join(X2,X3)) = join(meet(X3,X1),meet(X2,X1)),
distribution ).
cnf(c_0_5,plain,
meet(meet(X1,X2),meet(X2,join(X3,X1))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
meet(meet(X1,X2),X2) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_5,c_0_3]) ).
cnf(c_0_7,plain,
meet(X1,join(meet(X2,X1),X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_6]),c_0_4]) ).
cnf(c_0_8,plain,
meet(X1,join(X2,meet(X3,X1))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_6]),c_0_4]) ).
cnf(c_0_9,plain,
meet(X1,meet(X1,join(X2,X3))) = meet(X1,join(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_4]),c_0_8]) ).
cnf(c_0_10,plain,
meet(X1,join(X2,X1)) = meet(X1,X1),
inference(spm,[status(thm)],[c_0_9,c_0_3]) ).
cnf(c_0_11,plain,
meet(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_10]) ).
cnf(c_0_12,plain,
join(X1,meet(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_11]),c_0_10]),c_0_11]) ).
cnf(c_0_13,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_14,plain,
join(meet(X1,join(X2,X3)),X2) = meet(join(X2,X3),join(X2,X1)),
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_15,plain,
meet(X1,join(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_13]),c_0_13]) ).
cnf(c_0_17,plain,
join(X1,X2) = join(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11]) ).
cnf(c_0_18,plain,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
cnf(c_0_19,plain,
join(meet(X1,X2),meet(X2,join(X3,X1))) = meet(X2,join(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_5]),c_0_17]) ).
cnf(c_0_20,plain,
join(X1,meet(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_21,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_22,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_13]),c_0_13]) ).
cnf(c_0_23,plain,
meet(X1,meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_8]),c_0_13]) ).
cnf(c_0_24,plain,
meet(meet(X1,X2),meet(X3,X2)) = meet(meet(X1,X2),X3),
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_25,plain,
meet(meet(X1,X2),meet(meet(X3,X2),X1)) = meet(meet(X3,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_12]),c_0_16]) ).
cnf(c_0_26,plain,
meet(meet(X1,X2),join(X3,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_22]),c_0_15]) ).
cnf(c_0_27,plain,
meet(meet(X1,X2),X3) = meet(meet(X3,X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_24]) ).
cnf(c_0_28,plain,
meet(X1,meet(meet(X1,X2),X3)) = meet(meet(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_16]) ).
cnf(c_0_29,negated_conjecture,
meet(meet(a,b),c) != meet(a,meet(b,c)),
prove_associativity_of_meet ).
cnf(c_0_30,plain,
meet(meet(X1,X2),X3) = meet(X1,meet(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_27]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
meet(c,meet(a,b)) != meet(a,meet(b,c)),
inference(rw,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_32,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_30]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : LAT006-1 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n023.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 09:05:27 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.47/0.57 start to proof: theBenchmark
% 0.47/0.63 % Version : CSE_E---1.5
% 0.47/0.63 % Problem : theBenchmark.p
% 0.47/0.63 % Proof found
% 0.47/0.63 % SZS status Theorem for theBenchmark.p
% 0.47/0.63 % SZS output start Proof
% See solution above
% 0.52/0.63 % Total time : 0.049000 s
% 0.52/0.63 % SZS output end Proof
% 0.52/0.63 % Total time : 0.050000 s
%------------------------------------------------------------------------------