TSTP Solution File: SET864-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET864-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n028.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 14:36:04 EDT 2023
% Result : Unsatisfiable 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 25 ( 7 unt; 9 typ; 0 def)
% Number of atoms : 30 ( 6 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 32 ( 18 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 6 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
tc_set: $i > $i ).
tff(decl_23,type,
c_in: ( $i * $i * $i ) > $o ).
tff(decl_24,type,
c_Zorn_Omaxchain: ( $i * $i ) > $i ).
tff(decl_25,type,
c_Union: ( $i * $i ) > $i ).
tff(decl_26,type,
c_lessequals: ( $i * $i * $i ) > $o ).
tff(decl_27,type,
v_c: $i ).
tff(decl_28,type,
v_S: $i ).
tff(decl_29,type,
t_a: $i ).
tff(decl_30,type,
v_x: $i > $i ).
cnf(cls_Zorn_Omaxchain__Zorn_0,axiom,
( c_Union(X4,X3) = X1
| ~ c_in(X1,X2,tc_set(X3))
| ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__Zorn_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_5,negated_conjecture,
( X1 != v_x(X1)
| ~ c_in(X1,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_4,negated_conjecture,
( c_lessequals(X1,v_x(X1),tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_3,negated_conjecture,
( c_in(v_x(X1),v_S,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(c_0_6,axiom,
( c_Union(X4,X3) = X1
| ~ c_in(X1,X2,tc_set(X3))
| ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3)) ),
cls_Zorn_Omaxchain__Zorn_0 ).
cnf(c_0_7,negated_conjecture,
c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
cls_conjecture_0 ).
cnf(c_0_8,negated_conjecture,
( X1 != v_x(X1)
| ~ c_in(X1,v_S,tc_set(t_a)) ),
cls_conjecture_5 ).
cnf(c_0_9,negated_conjecture,
c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
cls_conjecture_2 ).
cnf(c_0_10,negated_conjecture,
( c_Union(v_c,t_a) = X1
| ~ c_lessequals(c_Union(v_c,t_a),X1,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( c_lessequals(X1,v_x(X1),tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
cls_conjecture_4 ).
cnf(c_0_12,negated_conjecture,
v_x(c_Union(v_c,t_a)) != c_Union(v_c,t_a),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
~ c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9])]),c_0_12]) ).
cnf(c_0_14,negated_conjecture,
( c_in(v_x(X1),v_S,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
cls_conjecture_3 ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET864-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n028.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 : Sat Aug 26 15:13:37 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.58 % Version : CSE_E---1.5
% 0.20/0.58 % Problem : theBenchmark.p
% 0.20/0.58 % Proof found
% 0.20/0.58 % SZS status Theorem for theBenchmark.p
% 0.20/0.58 % SZS output start Proof
% See solution above
% 0.20/0.58 % Total time : 0.003000 s
% 0.20/0.58 % SZS output end Proof
% 0.20/0.58 % Total time : 0.006000 s
%------------------------------------------------------------------------------