TSTP Solution File: LAT011-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LAT011-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/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:08 EDT 2023
% Result : Unsatisfiable 0.21s 0.70s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 38 ( 33 unt; 5 typ; 0 def)
% Number of atoms : 33 ( 32 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 ( 1 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 66 ( 14 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,
meet2: ( $i * $i ) > $i ).
tff(decl_25,type,
a: $i ).
tff(decl_26,type,
b: $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(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).
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_2,axiom,
join(X1,meet2(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption2_2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(commutativity_of_meet2,axiom,
meet2(X1,X2) = meet2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_meet2) ).
cnf(absorption1_2,axiom,
meet2(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption1_2) ).
cnf(associativity_of_meet2,axiom,
meet2(meet2(X1,X2),X3) = meet2(X1,meet2(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_meet2) ).
cnf(prove_meets_are_same,negated_conjecture,
meet(a,b) != meet2(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_meets_are_same) ).
cnf(c_0_10,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_11,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_12,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_13,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_14,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
join(X1,meet2(X1,X2)) = X1,
absorption2_2 ).
cnf(c_0_16,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_17,axiom,
meet2(X1,X2) = meet2(X2,X1),
commutativity_of_meet2 ).
cnf(c_0_18,plain,
join(meet(X1,X2),meet(X1,meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
meet(X1,meet2(X1,X2)) = meet2(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,plain,
join(X1,meet2(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_21,axiom,
meet2(X1,join(X1,X2)) = X1,
absorption1_2 ).
cnf(c_0_22,plain,
join(meet(X1,X2),meet(X1,meet2(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
meet(X1,meet2(X2,X1)) = meet2(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_16]) ).
cnf(c_0_24,plain,
meet2(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_25,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_26,plain,
join(meet2(X1,X2),meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_11]) ).
cnf(c_0_27,axiom,
meet2(meet2(X1,X2),X3) = meet2(X1,meet2(X2,X3)),
associativity_of_meet2 ).
cnf(c_0_28,plain,
meet2(X1,meet(X1,X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_12]),c_0_17]) ).
cnf(c_0_29,plain,
meet2(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17]) ).
cnf(c_0_30,negated_conjecture,
meet(a,b) != meet2(a,b),
prove_meets_are_same ).
cnf(c_0_31,plain,
meet(X1,X2) = meet2(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_26]),c_0_27]),c_0_28]),c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT011-1 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.16/0.35 % Computer : n019.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Thu Aug 24 04:52:43 EDT 2023
% 0.16/0.35 % CPUTime :
% 0.21/0.57 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.118000 s
% 0.21/0.71 % SZS output end Proof
% 0.21/0.71 % Total time : 0.121000 s
%------------------------------------------------------------------------------