TSTP Solution File: LAT044-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LAT044-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n018.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:20 EDT 2023
% Result : Unsatisfiable 167.18s 167.40s
% Output : CNFRefutation 167.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of formulae : 37 ( 30 unt; 7 typ; 0 def)
% Number of atoms : 30 ( 29 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 : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 4 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,
complement: $i > $i ).
tff(decl_25,type,
n1: $i ).
tff(decl_26,type,
n0: $i ).
tff(decl_27,type,
a: $i ).
tff(decl_28,type,
b: $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(orthomodular_law,axiom,
join(X1,meet(complement(X1),join(X1,X2))) = join(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',orthomodular_law) ).
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_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(compatibility1,axiom,
complement(join(X1,X2)) = meet(complement(X1),complement(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compatibility1) ).
cnf(invertability3,axiom,
complement(complement(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability3) ).
cnf(compatibility2,axiom,
complement(meet(X1,X2)) = join(complement(X1),complement(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compatibility2) ).
cnf(prove_weak_orthomodular_law,negated_conjecture,
join(meet(complement(a),join(a,b)),join(complement(b),meet(a,b))) != n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_weak_orthomodular_law) ).
cnf(invertability1,axiom,
join(complement(X1),X1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability1) ).
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,axiom,
join(X1,meet(complement(X1),join(X1,X2))) = join(X1,X2),
orthomodular_law ).
cnf(c_0_13,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_14,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_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,plain,
join(X1,meet(complement(X1),join(X2,X1))) = join(X2,X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
join(X1,join(meet(X2,X1),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
join(meet(X1,X2),meet(X1,complement(meet(X1,X2)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_10]),c_0_11]) ).
cnf(c_0_19,plain,
join(X1,meet(X2,complement(meet(X2,X1)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,axiom,
complement(join(X1,X2)) = meet(complement(X1),complement(X2)),
compatibility1 ).
cnf(c_0_21,axiom,
complement(complement(X1)) = X1,
invertability3 ).
cnf(c_0_22,axiom,
complement(meet(X1,X2)) = join(complement(X1),complement(X2)),
compatibility2 ).
cnf(c_0_23,negated_conjecture,
join(meet(complement(a),join(a,b)),join(complement(b),meet(a,b))) != n1,
prove_weak_orthomodular_law ).
cnf(c_0_24,plain,
join(complement(X1),meet(complement(X2),join(X2,X1))) = complement(meet(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).
cnf(c_0_25,axiom,
join(complement(X1),X1) = n1,
invertability1 ).
cnf(c_0_26,negated_conjecture,
join(meet(a,b),join(complement(b),meet(join(a,b),complement(a)))) != n1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_11]),c_0_13]),c_0_13]),c_0_14]) ).
cnf(c_0_27,plain,
join(complement(X1),meet(join(X2,X1),complement(X2))) = complement(meet(X1,X2)),
inference(spm,[status(thm)],[c_0_24,c_0_11]) ).
cnf(c_0_28,plain,
join(X1,complement(X1)) = n1,
inference(rw,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_11]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT044-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 24 08:21:13 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.19/0.61 start to proof: theBenchmark
% 167.18/167.39 % Version : CSE_E---1.5
% 167.18/167.39 % Problem : theBenchmark.p
% 167.18/167.40 % Proof found
% 167.18/167.40 % SZS status Theorem for theBenchmark.p
% 167.18/167.40 % SZS output start Proof
% See solution above
% 167.18/167.40 % Total time : 166.546000 s
% 167.18/167.40 % SZS output end Proof
% 167.18/167.40 % Total time : 166.554000 s
%------------------------------------------------------------------------------