TSTP Solution File: SEU163+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU163+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n031.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:57 EDT 2023
% Result : Theorem 0.23s 0.63s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 40
% Syntax : Number of formulae : 47 ( 3 unt; 38 typ; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 2 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 73 ( 33 >; 40 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 33 ( 33 usr; 5 con; 0-4 aty)
% Number of variables : 10 ( 0 sgn; 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
proper_subset: ( $i * $i ) > $o ).
tff(decl_24,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_25,type,
set_union2: ( $i * $i ) > $i ).
tff(decl_26,type,
set_intersection2: ( $i * $i ) > $i ).
tff(decl_27,type,
subset: ( $i * $i ) > $o ).
tff(decl_28,type,
singleton: $i > $i ).
tff(decl_29,type,
empty_set: $i ).
tff(decl_30,type,
powerset: $i > $i ).
tff(decl_31,type,
cartesian_product2: ( $i * $i ) > $i ).
tff(decl_32,type,
ordered_pair: ( $i * $i ) > $i ).
tff(decl_33,type,
union: $i > $i ).
tff(decl_34,type,
set_difference: ( $i * $i ) > $i ).
tff(decl_35,type,
disjoint: ( $i * $i ) > $o ).
tff(decl_36,type,
empty: $i > $o ).
tff(decl_37,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_38,type,
esk2_1: $i > $i ).
tff(decl_39,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_40,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_41,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_42,type,
esk6_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_43,type,
esk7_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_44,type,
esk8_3: ( $i * $i * $i ) > $i ).
tff(decl_45,type,
esk9_3: ( $i * $i * $i ) > $i ).
tff(decl_46,type,
esk10_3: ( $i * $i * $i ) > $i ).
tff(decl_47,type,
esk11_2: ( $i * $i ) > $i ).
tff(decl_48,type,
esk12_3: ( $i * $i * $i ) > $i ).
tff(decl_49,type,
esk13_3: ( $i * $i * $i ) > $i ).
tff(decl_50,type,
esk14_2: ( $i * $i ) > $i ).
tff(decl_51,type,
esk15_2: ( $i * $i ) > $i ).
tff(decl_52,type,
esk16_3: ( $i * $i * $i ) > $i ).
tff(decl_53,type,
esk17_0: $i ).
tff(decl_54,type,
esk18_0: $i ).
tff(decl_55,type,
esk19_2: ( $i * $i ) > $i ).
tff(decl_56,type,
esk20_2: ( $i * $i ) > $i ).
tff(decl_57,type,
esk21_2: ( $i * $i ) > $i ).
tff(decl_58,type,
esk22_0: $i ).
tff(decl_59,type,
esk23_0: $i ).
fof(t92_zfmisc_1,conjecture,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t92_zfmisc_1) ).
fof(l50_zfmisc_1,lemma,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l50_zfmisc_1) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
inference(assume_negation,[status(cth)],[t92_zfmisc_1]) ).
fof(c_0_3,negated_conjecture,
( in(esk22_0,esk23_0)
& ~ subset(esk22_0,union(esk23_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,lemma,
! [X138,X139] :
( ~ in(X138,X139)
| subset(X138,union(X139)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l50_zfmisc_1])]) ).
cnf(c_0_5,negated_conjecture,
~ subset(esk22_0,union(esk23_0)),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,lemma,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
in(esk22_0,esk23_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU163+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.15 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.15/0.36 % Computer : n031.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 24 01:53:50 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.23/0.59 start to proof: theBenchmark
% 0.23/0.63 % Version : CSE_E---1.5
% 0.23/0.63 % Problem : theBenchmark.p
% 0.23/0.63 % Proof found
% 0.23/0.63 % SZS status Theorem for theBenchmark.p
% 0.23/0.63 % SZS output start Proof
% See solution above
% 0.23/0.63 % Total time : 0.020000 s
% 0.23/0.63 % SZS output end Proof
% 0.23/0.63 % Total time : 0.023000 s
%------------------------------------------------------------------------------