TSTP Solution File: LAT033-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LAT033-1 : TPTP v8.1.2. Bugfixed v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n011.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:17 EDT 2023
% Result : Unsatisfiable 0.19s 0.69s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 11 ( 8 unt; 3 typ; 0 def)
% Number of atoms : 8 ( 7 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 : 3 ( 1 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 9 ( 4 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,
xx: $i ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',absorption2) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',absorption1) ).
cnf(idempotence_of_join,negated_conjecture,
join(xx,xx) != xx,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_of_join) ).
cnf(c_0_3,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_4,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_5,negated_conjecture,
join(xx,xx) != xx,
idempotence_of_join ).
cnf(c_0_6,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT033-1 : TPTP v8.1.2. Bugfixed v2.5.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 24 06:12:07 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.67 start to proof: theBenchmark
% 0.19/0.69 % Version : CSE_E---1.5
% 0.19/0.69 % Problem : theBenchmark.p
% 0.19/0.69 % Proof found
% 0.19/0.69 % SZS status Theorem for theBenchmark.p
% 0.19/0.69 % SZS output start Proof
% See solution above
% 0.19/0.69 % Total time : 0.003000 s
% 0.19/0.69 % SZS output end Proof
% 0.19/0.69 % Total time : 0.005000 s
%------------------------------------------------------------------------------