TSTP Solution File: SET916+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET916+1 : 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 : n018.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:15 EDT 2023
% Result : Theorem 0.21s 0.75s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of formulae : 43 ( 4 unt; 13 typ; 0 def)
% Number of atoms : 114 ( 34 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 140 ( 56 ~; 55 |; 24 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 8 >; 9 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 88 ( 4 sgn; 45 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_24,type,
set_intersection2: ( $i * $i ) > $i ).
tff(decl_25,type,
empty: $i > $o ).
tff(decl_26,type,
disjoint: ( $i * $i ) > $o ).
tff(decl_27,type,
esk1_3: ( $i * $i * $i ) > $i ).
tff(decl_28,type,
esk2_3: ( $i * $i * $i ) > $i ).
tff(decl_29,type,
esk3_0: $i ).
tff(decl_30,type,
esk4_0: $i ).
tff(decl_31,type,
esk5_2: ( $i * $i ) > $i ).
tff(decl_32,type,
esk6_0: $i ).
tff(decl_33,type,
esk7_0: $i ).
tff(decl_34,type,
esk8_0: $i ).
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(t4_xboole_0,axiom,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(t57_zfmisc_1,conjecture,
! [X1,X2,X3] :
~ ( ~ in(X1,X2)
& ~ in(X3,X2)
& ~ disjoint(unordered_pair(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t57_zfmisc_1) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(c_0_5,plain,
! [X20,X21,X22,X23,X24,X25,X26,X27] :
( ( in(X23,X20)
| ~ in(X23,X22)
| X22 != set_intersection2(X20,X21) )
& ( in(X23,X21)
| ~ in(X23,X22)
| X22 != set_intersection2(X20,X21) )
& ( ~ in(X24,X20)
| ~ in(X24,X21)
| in(X24,X22)
| X22 != set_intersection2(X20,X21) )
& ( ~ in(esk2_3(X25,X26,X27),X27)
| ~ in(esk2_3(X25,X26,X27),X25)
| ~ in(esk2_3(X25,X26,X27),X26)
| X27 = set_intersection2(X25,X26) )
& ( in(esk2_3(X25,X26,X27),X25)
| in(esk2_3(X25,X26,X27),X27)
| X27 = set_intersection2(X25,X26) )
& ( in(esk2_3(X25,X26,X27),X26)
| in(esk2_3(X25,X26,X27),X27)
| X27 = set_intersection2(X25,X26) ) ),
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])])])])])]) ).
fof(c_0_6,plain,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t4_xboole_0]) ).
fof(c_0_7,plain,
! [X11,X12,X13,X14,X15,X16,X17,X18] :
( ( ~ in(X14,X13)
| X14 = X11
| X14 = X12
| X13 != unordered_pair(X11,X12) )
& ( X15 != X11
| in(X15,X13)
| X13 != unordered_pair(X11,X12) )
& ( X15 != X12
| in(X15,X13)
| X13 != unordered_pair(X11,X12) )
& ( esk1_3(X16,X17,X18) != X16
| ~ in(esk1_3(X16,X17,X18),X18)
| X18 = unordered_pair(X16,X17) )
& ( esk1_3(X16,X17,X18) != X17
| ~ in(esk1_3(X16,X17,X18),X18)
| X18 = unordered_pair(X16,X17) )
& ( in(esk1_3(X16,X17,X18),X18)
| esk1_3(X16,X17,X18) = X16
| esk1_3(X16,X17,X18) = X17
| X18 = unordered_pair(X16,X17) ) ),
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)],[d2_tarski])])])])])]) ).
cnf(c_0_8,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X34,X35,X37,X38,X39] :
( ( disjoint(X34,X35)
| in(esk5_2(X34,X35),set_intersection2(X34,X35)) )
& ( ~ in(X39,set_intersection2(X37,X38))
| ~ disjoint(X37,X38) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
cnf(c_0_10,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( X1 = X3
| X1 = X4
| ~ in(X1,X2)
| X2 != unordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( disjoint(X1,X2)
| in(esk5_2(X1,X2),set_intersection2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( X1 = X2
| X1 = X3
| ~ in(X1,unordered_pair(X3,X2)) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( disjoint(X1,X2)
| in(esk5_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( disjoint(X1,X2)
| in(esk5_2(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_18,plain,
( esk5_2(X1,unordered_pair(X2,X3)) = X3
| esk5_2(X1,unordered_pair(X2,X3)) = X2
| disjoint(X1,unordered_pair(X2,X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_19,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( ~ in(X1,X2)
& ~ in(X3,X2)
& ~ disjoint(unordered_pair(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t57_zfmisc_1])]) ).
fof(c_0_20,plain,
! [X32,X33] :
( ~ disjoint(X32,X33)
| disjoint(X33,X32) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])]) ).
cnf(c_0_21,plain,
( esk5_2(X1,unordered_pair(X2,X3)) = X3
| disjoint(X1,unordered_pair(X2,X3))
| in(X2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_22,negated_conjecture,
( ~ in(esk6_0,esk7_0)
& ~ in(esk8_0,esk7_0)
& ~ disjoint(unordered_pair(esk6_0,esk8_0),esk7_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
cnf(c_0_23,plain,
( disjoint(X2,X1)
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
( disjoint(X1,unordered_pair(X2,X3))
| in(X2,X1)
| in(X3,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
~ disjoint(unordered_pair(esk6_0,esk8_0),esk7_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
( disjoint(unordered_pair(X1,X2),X3)
| in(X2,X3)
| in(X1,X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
~ in(esk8_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
~ in(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET916+1 : 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.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 16:16:45 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.59 start to proof: theBenchmark
% 0.21/0.75 % Version : CSE_E---1.5
% 0.21/0.75 % Problem : theBenchmark.p
% 0.21/0.75 % Proof found
% 0.21/0.75 % SZS status Theorem for theBenchmark.p
% 0.21/0.75 % SZS output start Proof
% See solution above
% 0.21/0.76 % Total time : 0.150000 s
% 0.21/0.76 % SZS output end Proof
% 0.21/0.76 % Total time : 0.153000 s
%------------------------------------------------------------------------------