TSTP Solution File: SEU294+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU294+1 : 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:24:11 EDT 2023
% Result : Theorem 0.19s 0.60s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 39
% Syntax : Number of formulae : 50 ( 5 unt; 36 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 27 ( 10 ~; 7 |; 5 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 19 >; 3 *; 0 +; 0 <<)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 17 con; 0-1 aty)
% Number of variables : 16 ( 0 sgn; 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
ordinal: $i > $o ).
tff(decl_24,type,
element: ( $i * $i ) > $o ).
tff(decl_25,type,
epsilon_transitive: $i > $o ).
tff(decl_26,type,
epsilon_connected: $i > $o ).
tff(decl_27,type,
empty: $i > $o ).
tff(decl_28,type,
finite: $i > $o ).
tff(decl_29,type,
function: $i > $o ).
tff(decl_30,type,
relation: $i > $o ).
tff(decl_31,type,
natural: $i > $o ).
tff(decl_32,type,
powerset: $i > $i ).
tff(decl_33,type,
one_to_one: $i > $o ).
tff(decl_34,type,
empty_set: $i ).
tff(decl_35,type,
relation_empty_yielding: $i > $o ).
tff(decl_36,type,
subset: ( $i * $i ) > $o ).
tff(decl_37,type,
esk1_1: $i > $i ).
tff(decl_38,type,
esk2_0: $i ).
tff(decl_39,type,
esk3_0: $i ).
tff(decl_40,type,
esk4_0: $i ).
tff(decl_41,type,
esk5_0: $i ).
tff(decl_42,type,
esk6_0: $i ).
tff(decl_43,type,
esk7_1: $i > $i ).
tff(decl_44,type,
esk8_0: $i ).
tff(decl_45,type,
esk9_1: $i > $i ).
tff(decl_46,type,
esk10_0: $i ).
tff(decl_47,type,
esk11_0: $i ).
tff(decl_48,type,
esk12_0: $i ).
tff(decl_49,type,
esk13_1: $i > $i ).
tff(decl_50,type,
esk14_0: $i ).
tff(decl_51,type,
esk15_1: $i > $i ).
tff(decl_52,type,
esk16_0: $i ).
tff(decl_53,type,
esk17_0: $i ).
tff(decl_54,type,
esk18_0: $i ).
tff(decl_55,type,
esk19_0: $i ).
tff(decl_56,type,
esk20_0: $i ).
tff(decl_57,type,
esk21_0: $i ).
fof(t13_finset_1,conjecture,
! [X1,X2] :
( ( subset(X1,X2)
& finite(X2) )
=> finite(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_finset_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(cc2_finset_1,axiom,
! [X1] :
( finite(X1)
=> ! [X2] :
( element(X2,powerset(X1))
=> finite(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc2_finset_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( ( subset(X1,X2)
& finite(X2) )
=> finite(X1) ),
inference(assume_negation,[status(cth)],[t13_finset_1]) ).
fof(c_0_4,plain,
! [X50,X51] :
( ( ~ element(X50,powerset(X51))
| subset(X50,X51) )
& ( ~ subset(X50,X51)
| element(X50,powerset(X51)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_5,negated_conjecture,
( subset(esk20_0,esk21_0)
& finite(esk21_0)
& ~ finite(esk20_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_6,plain,
! [X13,X14] :
( ~ finite(X13)
| ~ element(X14,powerset(X13))
| finite(X14) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_finset_1])])]) ).
cnf(c_0_7,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
subset(esk20_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( finite(X2)
| ~ finite(X1)
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
element(esk20_0,powerset(esk21_0)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
finite(esk21_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
~ finite(esk20_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU294+1 : 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.12/0.34 % Computer : n027.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 21:05:31 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 0.19/0.60 % Version : CSE_E---1.5
% 0.19/0.60 % Problem : theBenchmark.p
% 0.19/0.60 % Proof found
% 0.19/0.60 % SZS status Theorem for theBenchmark.p
% 0.19/0.60 % SZS output start Proof
% See solution above
% 0.19/0.60 % Total time : 0.010000 s
% 0.19/0.60 % SZS output end Proof
% 0.19/0.60 % Total time : 0.014000 s
%------------------------------------------------------------------------------