TSTP Solution File: SEU275+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU275+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 : 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:24:02 EDT 2023
% Result : Theorem 0.21s 0.64s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 21
% Syntax : Number of formulae : 41 ( 15 unt; 13 typ; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 22 ( 2 avg)
% Number of connectives : 73 ( 30 ~; 27 |; 10 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 24 ( 4 sgn; 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
ordinal: $i > $o ).
tff(decl_23,type,
epsilon_transitive: $i > $o ).
tff(decl_24,type,
epsilon_connected: $i > $o ).
tff(decl_25,type,
relation: $i > $o ).
tff(decl_26,type,
well_ordering: $i > $o ).
tff(decl_27,type,
reflexive: $i > $o ).
tff(decl_28,type,
transitive: $i > $o ).
tff(decl_29,type,
antisymmetric: $i > $o ).
tff(decl_30,type,
connected: $i > $o ).
tff(decl_31,type,
well_founded_relation: $i > $o ).
tff(decl_32,type,
inclusion_relation: $i > $i ).
tff(decl_33,type,
esk1_0: $i ).
tff(decl_34,type,
esk2_0: $i ).
fof(t7_wellord2,conjecture,
! [X1] :
( ordinal(X1)
=> well_ordering(inclusion_relation(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_wellord2) ).
fof(d4_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( well_ordering(X1)
<=> ( reflexive(X1)
& transitive(X1)
& antisymmetric(X1)
& connected(X1)
& well_founded_relation(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_wellord1) ).
fof(t6_wellord2,axiom,
! [X1] :
( ordinal(X1)
=> well_founded_relation(inclusion_relation(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_wellord2) ).
fof(t5_wellord2,axiom,
! [X1] : antisymmetric(inclusion_relation(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_wellord2) ).
fof(t3_wellord2,axiom,
! [X1] : transitive(inclusion_relation(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_wellord2) ).
fof(t2_wellord2,axiom,
! [X1] : reflexive(inclusion_relation(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_wellord2) ).
fof(dt_k1_wellord2,axiom,
! [X1] : relation(inclusion_relation(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_wellord2) ).
fof(t4_wellord2,axiom,
! [X1] :
( ordinal(X1)
=> connected(inclusion_relation(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_wellord2) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> well_ordering(inclusion_relation(X1)) ),
inference(assume_negation,[status(cth)],[t7_wellord2]) ).
fof(c_0_9,plain,
! [X4] :
( ( reflexive(X4)
| ~ well_ordering(X4)
| ~ relation(X4) )
& ( transitive(X4)
| ~ well_ordering(X4)
| ~ relation(X4) )
& ( antisymmetric(X4)
| ~ well_ordering(X4)
| ~ relation(X4) )
& ( connected(X4)
| ~ well_ordering(X4)
| ~ relation(X4) )
& ( well_founded_relation(X4)
| ~ well_ordering(X4)
| ~ relation(X4) )
& ( ~ reflexive(X4)
| ~ transitive(X4)
| ~ antisymmetric(X4)
| ~ connected(X4)
| ~ well_founded_relation(X4)
| well_ordering(X4)
| ~ relation(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_wellord1])])]) ).
fof(c_0_10,plain,
! [X11] :
( ~ ordinal(X11)
| well_founded_relation(inclusion_relation(X11)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_wellord2])]) ).
fof(c_0_11,plain,
! [X10] : antisymmetric(inclusion_relation(X10)),
inference(variable_rename,[status(thm)],[t5_wellord2]) ).
fof(c_0_12,plain,
! [X8] : transitive(inclusion_relation(X8)),
inference(variable_rename,[status(thm)],[t3_wellord2]) ).
fof(c_0_13,plain,
! [X7] : reflexive(inclusion_relation(X7)),
inference(variable_rename,[status(thm)],[t2_wellord2]) ).
fof(c_0_14,plain,
! [X5] : relation(inclusion_relation(X5)),
inference(variable_rename,[status(thm)],[dt_k1_wellord2]) ).
fof(c_0_15,plain,
! [X9] :
( ~ ordinal(X9)
| connected(inclusion_relation(X9)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_wellord2])]) ).
fof(c_0_16,negated_conjecture,
( ordinal(esk2_0)
& ~ well_ordering(inclusion_relation(esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_17,plain,
( well_ordering(X1)
| ~ reflexive(X1)
| ~ transitive(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ well_founded_relation(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( well_founded_relation(inclusion_relation(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
antisymmetric(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
transitive(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
reflexive(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
relation(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( connected(inclusion_relation(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
~ well_ordering(inclusion_relation(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( well_ordering(inclusion_relation(X1))
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
ordinal(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU275+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n031.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 : Wed Aug 23 14:33:50 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.62 start to proof: theBenchmark
% 0.21/0.64 % Version : CSE_E---1.5
% 0.21/0.64 % Problem : theBenchmark.p
% 0.21/0.64 % Proof found
% 0.21/0.64 % SZS status Theorem for theBenchmark.p
% 0.21/0.64 % SZS output start Proof
% See solution above
% 0.21/0.64 % Total time : 0.006000 s
% 0.21/0.64 % SZS output end Proof
% 0.21/0.64 % Total time : 0.009000 s
%------------------------------------------------------------------------------