TSTP Solution File: SET821-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET821-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n032.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:42 EDT 2023
% Result : Unsatisfiable 0.11s 0.42s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 19
% Syntax : Number of formulae : 40 ( 11 unt; 10 typ; 0 def)
% Number of atoms : 66 ( 19 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 57 ( 21 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 6 >; 7 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 43 ( 6 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
class_Orderings_Oorder: $i > $o ).
tff(decl_23,type,
c_less: ( $i * $i * $i ) > $o ).
tff(decl_24,type,
c_in: ( $i * $i * $i ) > $o ).
tff(decl_25,type,
tc_set: $i > $i ).
tff(decl_26,type,
c_uminus: ( $i * $i ) > $i ).
tff(decl_27,type,
c_insert: ( $i * $i * $i ) > $i ).
tff(decl_28,type,
v_a: $i ).
tff(decl_29,type,
v_b: $i ).
tff(decl_30,type,
tc_IntDef_Oint: $i ).
tff(decl_31,type,
v_c: $i ).
cnf(cls_Set_OinsertE_0,axiom,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertE_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( c_in(v_c,X1,tc_IntDef_Oint)
| c_in(v_a,X1,tc_IntDef_Oint)
| ~ c_in(v_b,X1,tc_IntDef_Oint) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_1) ).
cnf(cls_Set_OComplD__dest_0,axiom,
( ~ c_in(X1,X2,X3)
| ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OComplD__dest_0) ).
cnf(cls_Set_OinsertCI_0,axiom,
( c_in(X1,c_insert(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_less(v_b,v_c,tc_IntDef_Oint),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Orderings_Oorder__less__irrefl__iff1_0,axiom,
( ~ class_Orderings_Oorder(X1)
| ~ c_less(X2,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Oorder__less__irrefl__iff1_0) ).
cnf(clsarity_IntDef__Oint_31,axiom,
class_Orderings_Oorder(tc_IntDef_Oint),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_IntDef__Oint_31) ).
cnf(cls_conjecture_0,negated_conjecture,
c_less(v_a,v_b,tc_IntDef_Oint),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_9,axiom,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
cls_Set_OinsertE_0 ).
cnf(c_0_10,negated_conjecture,
( c_in(v_c,X1,tc_IntDef_Oint)
| c_in(v_a,X1,tc_IntDef_Oint)
| ~ c_in(v_b,X1,tc_IntDef_Oint) ),
cls_conjecture_2 ).
cnf(c_0_11,negated_conjecture,
( v_c = X1
| c_in(v_a,c_insert(X1,X2,tc_IntDef_Oint),tc_IntDef_Oint)
| c_in(v_c,X2,tc_IntDef_Oint)
| ~ c_in(v_b,c_insert(X1,X2,tc_IntDef_Oint),tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
( v_c = X1
| v_a = X1
| c_in(v_c,X2,tc_IntDef_Oint)
| c_in(v_a,X2,tc_IntDef_Oint)
| ~ c_in(v_b,c_insert(X1,X2,tc_IntDef_Oint),tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_13,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_14,axiom,
( ~ c_in(X1,X2,X3)
| ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
cls_Set_OComplD__dest_0 ).
cnf(c_0_15,negated_conjecture,
( v_a = v_b
| v_c = v_b
| c_in(v_a,X1,tc_IntDef_Oint)
| c_in(v_c,X1,tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( v_c = v_b
| v_a = v_b
| c_in(v_a,c_uminus(X1,tc_set(tc_IntDef_Oint)),tc_IntDef_Oint)
| ~ c_in(v_c,X1,tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
( v_a = v_b
| v_c = v_b
| ~ c_in(v_a,X1,tc_IntDef_Oint)
| ~ c_in(v_c,X1,tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( v_c = v_b
| v_a = v_b
| ~ c_in(v_a,c_insert(v_c,X1,tc_IntDef_Oint),tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_19,axiom,
( c_in(X1,c_insert(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_OinsertCI_0 ).
cnf(c_0_20,negated_conjecture,
( v_a = v_b
| v_c = v_b
| ~ c_in(v_a,X1,tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
c_less(v_b,v_c,tc_IntDef_Oint),
cls_conjecture_1 ).
cnf(c_0_22,negated_conjecture,
( v_c = v_b
| v_a = v_b ),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_23,axiom,
( ~ class_Orderings_Oorder(X1)
| ~ c_less(X2,X2,X1) ),
cls_Orderings_Oorder__less__irrefl__iff1_0 ).
cnf(c_0_24,negated_conjecture,
( v_a = v_b
| c_less(v_b,v_b,tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,axiom,
class_Orderings_Oorder(tc_IntDef_Oint),
clsarity_IntDef__Oint_31 ).
cnf(c_0_26,negated_conjecture,
c_less(v_a,v_b,tc_IntDef_Oint),
cls_conjecture_0 ).
cnf(c_0_27,negated_conjecture,
v_a = v_b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_28,negated_conjecture,
c_less(v_b,v_b,tc_IntDef_Oint),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_28]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SET821-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.07 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.06/0.26 % Computer : n032.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 300
% 0.06/0.26 % DateTime : Sat Aug 26 15:00:29 EDT 2023
% 0.06/0.26 % CPUTime :
% 0.11/0.42 start to proof: theBenchmark
% 0.11/0.42 % Version : CSE_E---1.5
% 0.11/0.42 % Problem : theBenchmark.p
% 0.11/0.42 % Proof found
% 0.11/0.42 % SZS status Theorem for theBenchmark.p
% 0.11/0.42 % SZS output start Proof
% See solution above
% 0.11/0.43 % Total time : 0.003000 s
% 0.11/0.43 % SZS output end Proof
% 0.11/0.43 % Total time : 0.004000 s
%------------------------------------------------------------------------------