TSTP Solution File: NUM387+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM387+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n022.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 10:37:10 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 28
% Syntax : Number of formulae : 42 ( 14 unt; 24 typ; 0 def)
% Number of atoms : 22 ( 8 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 9 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 12 >; 3 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 12 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn; 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
empty: $i > $o ).
tff(decl_24,type,
function: $i > $o ).
tff(decl_25,type,
relation: $i > $o ).
tff(decl_26,type,
one_to_one: $i > $o ).
tff(decl_27,type,
set_union2: ( $i * $i ) > $i ).
tff(decl_28,type,
succ: $i > $i ).
tff(decl_29,type,
singleton: $i > $i ).
tff(decl_30,type,
element: ( $i * $i ) > $o ).
tff(decl_31,type,
empty_set: $i ).
tff(decl_32,type,
relation_empty_yielding: $i > $o ).
tff(decl_33,type,
relation_non_empty: $i > $o ).
tff(decl_34,type,
esk1_1: $i > $i ).
tff(decl_35,type,
esk2_0: $i ).
tff(decl_36,type,
esk3_0: $i ).
tff(decl_37,type,
esk4_0: $i ).
tff(decl_38,type,
esk5_0: $i ).
tff(decl_39,type,
esk6_0: $i ).
tff(decl_40,type,
esk7_0: $i ).
tff(decl_41,type,
esk8_0: $i ).
tff(decl_42,type,
esk9_0: $i ).
tff(decl_43,type,
esk10_0: $i ).
tff(decl_44,type,
esk11_0: $i ).
tff(decl_45,type,
esk12_0: $i ).
fof(t14_ordinal1,conjecture,
! [X1] : X1 != succ(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_ordinal1) ).
fof(t10_ordinal1,axiom,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] : X1 != succ(X1),
inference(assume_negation,[status(cth)],[t14_ordinal1]) ).
fof(c_0_5,plain,
! [X31] : in(X31,succ(X31)),
inference(variable_rename,[status(thm)],[t10_ordinal1]) ).
fof(c_0_6,plain,
! [X10] : succ(X10) = set_union2(X10,singleton(X10)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_7,negated_conjecture,
esk12_0 = succ(esk12_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_8,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
cnf(c_0_9,plain,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
esk12_0 = succ(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
cnf(c_0_13,plain,
in(X1,set_union2(X1,singleton(X1))),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
esk12_0 = set_union2(esk12_0,singleton(esk12_0)),
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_15,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
in(esk12_0,esk12_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM387+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 25 09:03:10 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.59 % Version : CSE_E---1.5
% 0.20/0.59 % Problem : theBenchmark.p
% 0.20/0.59 % Proof found
% 0.20/0.59 % SZS status Theorem for theBenchmark.p
% 0.20/0.59 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.009000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.012000 s
%------------------------------------------------------------------------------