TSTP Solution File: SEU121+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU121+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 : n011.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:32 EDT 2023
% Result : Theorem 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 32 ( 4 unt; 16 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 35 ( 13 ~; 12 |; 6 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 10 >; 9 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 25 ( 0 sgn; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
set_intersection2: ( $i * $i ) > $i ).
tff(decl_24,type,
empty_set: $i ).
tff(decl_25,type,
subset: ( $i * $i ) > $o ).
tff(decl_26,type,
disjoint: ( $i * $i ) > $o ).
tff(decl_27,type,
empty: $i > $o ).
tff(decl_28,type,
esk1_1: $i > $i ).
tff(decl_29,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_30,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_31,type,
esk4_0: $i ).
tff(decl_32,type,
esk5_0: $i ).
tff(decl_33,type,
esk6_0: $i ).
tff(decl_34,type,
esk7_0: $i ).
tff(decl_35,type,
esk8_0: $i ).
tff(decl_36,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_37,type,
esk10_2: ( $i * $i ) > $i ).
fof(t1_xboole_1,conjecture,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_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(c_0_2,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
inference(assume_negation,[status(cth)],[t1_xboole_1]) ).
fof(c_0_3,plain,
! [X13,X14,X15,X16,X17] :
( ( ~ subset(X13,X14)
| ~ in(X15,X13)
| in(X15,X14) )
& ( in(esk2_2(X16,X17),X16)
| subset(X16,X17) )
& ( ~ in(esk2_2(X16,X17),X17)
| subset(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)],[d3_tarski])])])])])]) ).
fof(c_0_4,negated_conjecture,
( subset(esk6_0,esk7_0)
& subset(esk7_0,esk8_0)
& ~ subset(esk6_0,esk8_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_5,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
subset(esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( in(X1,esk8_0)
| ~ in(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
subset(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( subset(X1,esk8_0)
| ~ in(esk2_2(X1,esk8_0),esk7_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( in(X1,esk7_0)
| ~ in(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( subset(X1,esk8_0)
| ~ in(esk2_2(X1,esk8_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
( in(esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
~ subset(esk6_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU121+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Aug 23 16:21:51 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.58 % Version : CSE_E---1.5
% 0.20/0.58 % Problem : theBenchmark.p
% 0.20/0.58 % Proof found
% 0.20/0.58 % SZS status Theorem for theBenchmark.p
% 0.20/0.58 % SZS output start Proof
% See solution above
% 0.20/0.58 % Total time : 0.009000 s
% 0.20/0.58 % SZS output end Proof
% 0.20/0.58 % Total time : 0.012000 s
%------------------------------------------------------------------------------