TSTP Solution File: SEU128+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU128+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n027.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 16:22:36 EDT 2023
% Result : Theorem 0.20s 0.71s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 21
% Syntax : Number of formulae : 40 ( 8 unt; 18 typ; 0 def)
% Number of atoms : 69 ( 8 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 73 ( 26 ~; 29 |; 12 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 12 >; 12 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 42 ( 0 sgn; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
set_union2: ( $i * $i ) > $i ).
tff(decl_24,type,
set_intersection2: ( $i * $i ) > $i ).
tff(decl_25,type,
subset: ( $i * $i ) > $o ).
tff(decl_26,type,
empty_set: $i ).
tff(decl_27,type,
disjoint: ( $i * $i ) > $o ).
tff(decl_28,type,
empty: $i > $o ).
tff(decl_29,type,
esk1_1: $i > $i ).
tff(decl_30,type,
esk2_3: ( $i * $i * $i ) > $i ).
tff(decl_31,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_32,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_33,type,
esk5_0: $i ).
tff(decl_34,type,
esk6_0: $i ).
tff(decl_35,type,
esk7_0: $i ).
tff(decl_36,type,
esk8_0: $i ).
tff(decl_37,type,
esk9_0: $i ).
tff(decl_38,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_39,type,
esk11_2: ( $i * $i ) > $i ).
fof(t19_xboole_1,conjecture,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
inference(assume_negation,[status(cth)],[t19_xboole_1]) ).
fof(c_0_4,negated_conjecture,
( subset(esk7_0,esk8_0)
& subset(esk7_0,esk9_0)
& ~ subset(esk7_0,set_intersection2(esk8_0,esk9_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X26,X27,X28,X29,X30] :
( ( ~ subset(X26,X27)
| ~ in(X28,X26)
| in(X28,X27) )
& ( in(esk3_2(X29,X30),X29)
| subset(X29,X30) )
& ( ~ in(esk3_2(X29,X30),X30)
| subset(X29,X30) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).
cnf(c_0_6,negated_conjecture,
~ subset(esk7_0,set_intersection2(esk8_0,esk9_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X32,X33,X34,X35,X36,X37,X38,X39] :
( ( in(X35,X32)
| ~ in(X35,X34)
| X34 != set_intersection2(X32,X33) )
& ( in(X35,X33)
| ~ in(X35,X34)
| X34 != set_intersection2(X32,X33) )
& ( ~ in(X36,X32)
| ~ in(X36,X33)
| in(X36,X34)
| X34 != set_intersection2(X32,X33) )
& ( ~ in(esk4_3(X37,X38,X39),X39)
| ~ in(esk4_3(X37,X38,X39),X37)
| ~ in(esk4_3(X37,X38,X39),X38)
| X39 = set_intersection2(X37,X38) )
& ( in(esk4_3(X37,X38,X39),X37)
| in(esk4_3(X37,X38,X39),X39)
| X39 = set_intersection2(X37,X38) )
& ( in(esk4_3(X37,X38,X39),X38)
| in(esk4_3(X37,X38,X39),X39)
| X39 = set_intersection2(X37,X38) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_xboole_0])])])])])]) ).
cnf(c_0_9,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),esk7_0),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),X1)
| ~ subset(esk7_0,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
subset(esk7_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),esk9_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
subset(esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),set_intersection2(X1,esk9_0))
| ~ in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),esk8_0),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),set_intersection2(esk8_0,esk9_0)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU128+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.17/0.35 % Computer : n027.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Wed Aug 23 19:27:46 EDT 2023
% 0.17/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.71 % Version : CSE_E---1.5
% 0.20/0.71 % Problem : theBenchmark.p
% 0.20/0.71 % Proof found
% 0.20/0.71 % SZS status Theorem for theBenchmark.p
% 0.20/0.71 % SZS output start Proof
% See solution above
% 0.20/0.72 % Total time : 0.132000 s
% 0.20/0.72 % SZS output end Proof
% 0.20/0.72 % Total time : 0.136000 s
%------------------------------------------------------------------------------