TSTP Solution File: LAT021-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LAT021-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 : n019.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:14 EDT 2023
% Result : Unsatisfiable 0.21s 0.70s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 15
% Syntax : Number of formulae : 51 ( 46 unt; 5 typ; 0 def)
% Number of atoms : 46 ( 45 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 : 5 ( 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 : 112 ( 0 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(quasi_lattice2,axiom,
meet(join(X1,meet(X2,X3)),join(X1,X2)) = join(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-0.ax',quasi_lattice2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-0.ax',commutativity_of_meet) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-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/LAT004-0.ax',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-0.ax',idempotence_of_meet) ).
cnf(quasi_lattice1,axiom,
join(meet(X1,join(X2,X3)),meet(X1,X2)) = meet(X1,join(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-0.ax',quasi_lattice1) ).
cnf(bowden,hypothesis,
join(join(X1,meet(X2,X3)),meet(join(X1,X2),X3)) = join(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bowden) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-0.ax',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-0.ax',idempotence_of_join) ).
cnf(prove_distributivity,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity) ).
cnf(c_0_10,axiom,
meet(join(X1,meet(X2,X3)),join(X1,X2)) = join(X1,meet(X2,X3)),
quasi_lattice2 ).
cnf(c_0_11,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_12,plain,
meet(join(X1,X2),join(X1,meet(X2,X3))) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_14,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_15,plain,
meet(join(X1,X2),join(meet(X2,X3),X1)) = join(meet(X2,X3),X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_17,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_18,plain,
meet(join(X1,X2),join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
join(meet(X1,join(X2,X3)),meet(X1,X2)) = meet(X1,join(X2,X3)),
quasi_lattice1 ).
cnf(c_0_20,hypothesis,
join(join(X1,meet(X2,X3)),meet(join(X1,X2),X3)) = join(X1,meet(X2,X3)),
bowden ).
cnf(c_0_21,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_22,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X2,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_23,plain,
meet(join(X1,X2),meet(join(X2,X1),X3)) = meet(join(X2,X1),X3),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_24,plain,
join(meet(X1,X2),meet(X1,join(X2,X3))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_25,hypothesis,
join(X1,join(meet(X2,X3),meet(join(X1,X2),X3))) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
meet(join(X1,X2),X3) = meet(X3,join(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_18]) ).
cnf(c_0_27,plain,
join(meet(X1,X2),meet(X2,join(X1,X3))) = meet(X2,join(X1,X3)),
inference(spm,[status(thm)],[c_0_24,c_0_11]) ).
cnf(c_0_28,hypothesis,
join(X1,meet(X2,join(X3,X1))) = join(X1,meet(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_29,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_30,hypothesis,
join(X1,meet(X2,join(X1,X3))) = join(X1,meet(X3,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_31,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_32,plain,
join(meet(X1,X2),meet(X3,X1)) = meet(X1,join(meet(X1,X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_30]) ).
cnf(c_0_33,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_31]) ).
cnf(c_0_34,plain,
join(meet(X1,X2),meet(X2,X3)) = meet(X2,join(meet(X2,X3),X1)),
inference(spm,[status(thm)],[c_0_13,c_0_32]) ).
cnf(c_0_35,hypothesis,
join(X1,meet(join(X2,X1),X3)) = join(X1,meet(X2,X3)),
inference(spm,[status(thm)],[c_0_28,c_0_11]) ).
cnf(c_0_36,plain,
meet(join(X1,X2),join(meet(X1,X3),X2)) = join(meet(X1,X3),X2),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_37,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_33,c_0_13]) ).
cnf(c_0_38,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_29,c_0_11]) ).
cnf(c_0_39,plain,
meet(X1,join(X2,meet(X3,X1))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_34]),c_0_13]),c_0_30]) ).
cnf(c_0_40,hypothesis,
join(meet(X1,X2),X3) = join(X3,meet(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_28]),c_0_14]),c_0_38]) ).
cnf(c_0_41,hypothesis,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(X3,X2)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
join(meet(X1,X2),meet(X2,X3)) = meet(X2,join(X1,X3)),
inference(rw,[status(thm)],[c_0_34,c_0_41]) ).
cnf(c_0_43,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
prove_distributivity ).
cnf(c_0_44,hypothesis,
join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(X3,X2)),
inference(spm,[status(thm)],[c_0_40,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT021-1 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n019.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 : Thu Aug 24 08:36:14 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.55 start to proof: theBenchmark
% 0.21/0.70 % Version : CSE_E---1.5
% 0.21/0.70 % Problem : theBenchmark.p
% 0.21/0.70 % Proof found
% 0.21/0.70 % SZS status Theorem for theBenchmark.p
% 0.21/0.70 % SZS output start Proof
% See solution above
% 0.21/0.71 % Total time : 0.141000 s
% 0.21/0.71 % SZS output end Proof
% 0.21/0.71 % Total time : 0.144000 s
%------------------------------------------------------------------------------