TSTP Solution File: LAT143-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LAT143-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n010.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:46 EDT 2023
% Result : Unsatisfiable 39.41s 39.48s
% Output : CNFRefutation 39.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 46 ( 41 unt; 5 typ; 0 def)
% Number of atoms : 41 ( 40 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 : 6 ( 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 : 96 ( 10 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,
a: $i ).
tff(decl_25,type,
b: $i ).
tff(decl_26,type,
c: $i ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(equation_H24,axiom,
join(meet(X1,X2),meet(X2,X3)) = join(meet(X1,X2),meet(X2,join(meet(X1,X2),meet(X3,join(X1,X2))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equation_H24) ).
cnf(prove_H15,negated_conjecture,
meet(a,join(meet(a,b),meet(a,c))) != meet(a,join(meet(a,b),join(meet(a,c),meet(c,join(a,b))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_H15) ).
cnf(c_0_8,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_9,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_10,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_11,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_12,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_13,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_15,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_17,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_18,plain,
meet(X1,meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_11]),c_0_10]) ).
cnf(c_0_19,axiom,
join(meet(X1,X2),meet(X2,X3)) = join(meet(X1,X2),meet(X2,join(meet(X1,X2),meet(X3,join(X1,X2))))),
equation_H24 ).
cnf(c_0_20,plain,
meet(X1,meet(X2,join(meet(X2,X1),X3))) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_21,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_8]),c_0_16]) ).
cnf(c_0_22,plain,
meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_17]) ).
cnf(c_0_23,plain,
join(meet(X1,X2),meet(X1,join(meet(X1,X2),meet(X3,join(X2,X1))))) = join(meet(X1,X2),meet(X1,X3)),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_24,plain,
join(meet(X1,X2),meet(X1,join(meet(X1,X2),X3))) = meet(X1,join(meet(X1,X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_9]) ).
cnf(c_0_25,plain,
join(X1,meet(join(X2,X1),join(X1,meet(X3,join(X1,X2))))) = join(X1,meet(join(X2,X1),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_21]) ).
cnf(c_0_26,plain,
join(meet(X1,X2),meet(X2,join(meet(X1,X2),X3))) = meet(X2,join(meet(X1,X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_9]) ).
cnf(c_0_27,negated_conjecture,
meet(a,join(meet(a,b),meet(a,c))) != meet(a,join(meet(a,b),join(meet(a,c),meet(c,join(a,b))))),
prove_H15 ).
cnf(c_0_28,plain,
join(meet(X1,X2),meet(X2,join(X1,X3))) = meet(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_22]),c_0_9]) ).
cnf(c_0_29,plain,
join(meet(X1,X2),meet(X1,join(meet(X1,X2),meet(X3,join(X1,X2))))) = join(meet(X1,X2),meet(X1,X3)),
inference(spm,[status(thm)],[c_0_23,c_0_9]) ).
cnf(c_0_30,plain,
meet(X1,meet(join(meet(X1,X2),meet(X1,X3)),join(meet(X1,X2),meet(X3,join(X2,X1))))) = meet(X1,join(meet(X1,X2),meet(X3,join(X2,X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_23]),c_0_10]),c_0_12]) ).
cnf(c_0_31,plain,
meet(X1,join(meet(X1,X2),meet(X3,join(X2,X1)))) = join(meet(X1,X2),meet(X1,X3)),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,plain,
join(meet(X1,X2),meet(join(meet(X1,X2),meet(X1,X3)),join(meet(X1,X2),meet(X3,join(X2,X1))))) = join(meet(X1,X2),meet(X1,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_25,c_0_23]),c_0_9]),c_0_12]),c_0_9]),c_0_12]),c_0_23]) ).
cnf(c_0_33,plain,
join(X1,meet(join(X1,X2),join(X1,X3))) = meet(join(X1,X2),join(X1,X3)),
inference(spm,[status(thm)],[c_0_26,c_0_8]) ).
cnf(c_0_34,negated_conjecture,
meet(a,join(meet(a,b),meet(c,join(a,b)))) != meet(a,join(meet(a,b),meet(a,c))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
meet(X1,join(meet(X1,X2),meet(X3,join(X1,X2)))) = join(meet(X1,X2),meet(X1,X3)),
inference(rw,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_36,plain,
meet(X1,meet(join(meet(X1,X2),meet(X1,X3)),join(meet(X1,X2),meet(X3,join(X2,X1))))) = join(meet(X1,X2),meet(X1,X3)),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
meet(join(meet(X1,X2),meet(X1,X3)),join(meet(X1,X2),meet(X3,join(X2,X1)))) = join(meet(X1,X2),meet(X1,X3)),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
meet(a,join(meet(a,b),meet(a,c))) != join(meet(a,b),meet(a,c)),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
meet(X1,join(meet(X1,X2),meet(X1,X3))) = join(meet(X1,X2),meet(X1,X3)),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT143-1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n010.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 : Thu Aug 24 09:41:50 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 39.41/39.48 % Version : CSE_E---1.5
% 39.41/39.48 % Problem : theBenchmark.p
% 39.41/39.48 % Proof found
% 39.41/39.48 % SZS status Theorem for theBenchmark.p
% 39.41/39.48 % SZS output start Proof
% See solution above
% 39.41/39.48 % Total time : 38.902000 s
% 39.41/39.48 % SZS output end Proof
% 39.41/39.48 % Total time : 38.906000 s
%------------------------------------------------------------------------------