TSTP Solution File: SET834-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET834-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 : n021.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:35:48 EDT 2023
% Result : Unsatisfiable 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 20
% Syntax : Number of formulae : 39 ( 10 unt; 10 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 51 ( 25 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 5 >; 8 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 63 ( 6 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
c_in: ( $i * $i * $i ) > $o ).
tff(decl_23,type,
c_union: ( $i * $i * $i ) > $i ).
tff(decl_24,type,
tc_set: $i > $i ).
tff(decl_25,type,
c_lessequals: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
c_Main_OsubsetI__1: ( $i * $i * $i ) > $i ).
tff(decl_27,type,
v_x: $i ).
tff(decl_28,type,
v_X: $i ).
tff(decl_29,type,
t_a: $i ).
tff(decl_30,type,
v_Z: $i ).
tff(decl_31,type,
v_Y: $i ).
cnf(cls_Set_OsubsetI_1,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).
cnf(cls_Set_OUnCI_0,axiom,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnCI_0) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).
cnf(cls_Set_OUnCI_1,axiom,
( c_in(X1,c_union(X2,X4,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnCI_1) ).
cnf(cls_conjecture_5,negated_conjecture,
( c_lessequals(v_X,X1,tc_set(t_a))
| ~ c_lessequals(v_Z,X1,tc_set(t_a))
| ~ c_lessequals(v_Y,X1,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_Set_OsubsetD_0,axiom,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetD_0) ).
cnf(cls_Set_OUnE_0,axiom,
( c_in(X1,X3,X4)
| c_in(X1,X2,X4)
| ~ c_in(X1,c_union(X2,X3,X4),X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnE_0) ).
cnf(cls_conjecture_4,negated_conjecture,
~ c_in(v_x,v_Y,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(v_x,v_X,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_in(v_x,v_Z,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(c_0_10,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
cls_Set_OsubsetI_1 ).
cnf(c_0_11,axiom,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_OUnCI_0 ).
cnf(c_0_12,plain,
( c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4))
| ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X3,X4) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
cls_Set_OsubsetI_0 ).
cnf(c_0_14,axiom,
( c_in(X1,c_union(X2,X4,X3),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_OUnCI_1 ).
cnf(c_0_15,negated_conjecture,
( c_lessequals(v_X,X1,tc_set(t_a))
| ~ c_lessequals(v_Z,X1,tc_set(t_a))
| ~ c_lessequals(v_Y,X1,tc_set(t_a)) ),
cls_conjecture_5 ).
cnf(c_0_16,plain,
c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4))
| ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X2,X4) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( c_lessequals(v_X,c_union(X1,v_Y,t_a),tc_set(t_a))
| ~ c_lessequals(v_Z,c_union(X1,v_Y,t_a),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_20,axiom,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
cls_Set_OsubsetD_0 ).
cnf(c_0_21,negated_conjecture,
c_lessequals(v_X,c_union(v_Z,v_Y,t_a),tc_set(t_a)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
( c_in(X1,X3,X4)
| c_in(X1,X2,X4)
| ~ c_in(X1,c_union(X2,X3,X4),X4) ),
cls_Set_OUnE_0 ).
cnf(c_0_23,negated_conjecture,
( c_in(X1,c_union(v_Z,v_Y,t_a),t_a)
| ~ c_in(X1,v_X,t_a) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
~ c_in(v_x,v_Y,t_a),
cls_conjecture_4 ).
cnf(c_0_25,negated_conjecture,
( c_in(X1,v_Z,t_a)
| c_in(X1,v_Y,t_a)
| ~ c_in(X1,v_X,t_a) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
c_in(v_x,v_X,t_a),
cls_conjecture_2 ).
cnf(c_0_27,negated_conjecture,
~ c_in(v_x,v_Z,t_a),
cls_conjecture_3 ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET834-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.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 10:29:41 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.60 % Version : CSE_E---1.5
% 0.20/0.60 % Problem : theBenchmark.p
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark.p
% 0.20/0.60 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.005000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.008000 s
%------------------------------------------------------------------------------