%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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 : 600s
% DateTime : Tue Jul 19 14:35:35 EDT 2022
% Result : Theorem 0.17s 0.42s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of clauses : 38 ( 15 unt; 0 nHn; 38 RR)
% Number of literals : 80 ( 0 equ; 44 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
well_ordering(skc2),
file('SEU257+1.p',unknown),
[] ).
cnf(2,axiom,
relation(skc2),
file('SEU257+1.p',unknown),
[] ).
cnf(3,axiom,
~ well_ordering(relation_restriction(skc2,skc3)),
file('SEU257+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ relation(u)
| relation(relation_restriction(u,v)) ),
file('SEU257+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ relation(u)
| ~ well_ordering(u)
| reflexive(u) ),
file('SEU257+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ relation(u)
| ~ well_ordering(u)
| transitive(u) ),
file('SEU257+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ relation(u)
| ~ well_ordering(u)
| antisymmetric(u) ),
file('SEU257+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ relation(u)
| ~ well_ordering(u)
| connected(u) ),
file('SEU257+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ relation(u)
| ~ well_ordering(u)
| well_founded_relation(u) ),
file('SEU257+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ relation(u)
| ~ reflexive(u)
| reflexive(relation_restriction(u,v)) ),
file('SEU257+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ relation(u)
| ~ connected(u)
| connected(relation_restriction(u,v)) ),
file('SEU257+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ relation(u)
| ~ transitive(u)
| transitive(relation_restriction(u,v)) ),
file('SEU257+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ relation(u)
| ~ antisymmetric(u)
| antisymmetric(relation_restriction(u,v)) ),
file('SEU257+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ relation(u)
| ~ well_founded_relation(u)
| well_founded_relation(relation_restriction(u,v)) ),
file('SEU257+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ relation(u)
| ~ well_founded_relation(u)
| ~ connected(u)
| ~ antisymmetric(u)
| ~ transitive(u)
| ~ reflexive(u)
| well_ordering(u) ),
file('SEU257+1.p',unknown),
[] ).
cnf(21,plain,
( ~ reflexive(skc2)
| reflexive(relation_restriction(skc2,u)) ),
inference(res,[status(thm),theory(equality)],[2,12]),
[iquote('0:Res:2.0,12.1')] ).
cnf(22,plain,
( ~ connected(skc2)
| connected(relation_restriction(skc2,u)) ),
inference(res,[status(thm),theory(equality)],[2,13]),
[iquote('0:Res:2.0,13.1')] ).
cnf(23,plain,
( ~ transitive(skc2)
| transitive(relation_restriction(skc2,u)) ),
inference(res,[status(thm),theory(equality)],[2,14]),
[iquote('0:Res:2.0,14.1')] ).
cnf(24,plain,
( ~ antisymmetric(skc2)
| antisymmetric(relation_restriction(skc2,u)) ),
inference(res,[status(thm),theory(equality)],[2,15]),
[iquote('0:Res:2.0,15.1')] ).
cnf(25,plain,
( ~ well_founded_relation(skc2)
| well_founded_relation(relation_restriction(skc2,u)) ),
inference(res,[status(thm),theory(equality)],[2,16]),
[iquote('0:Res:2.0,16.1')] ).
cnf(26,plain,
( ~ well_ordering(skc2)
| reflexive(skc2) ),
inference(res,[status(thm),theory(equality)],[2,7]),
[iquote('0:Res:2.0,7.1')] ).
cnf(27,plain,
( ~ well_ordering(skc2)
| transitive(skc2) ),
inference(res,[status(thm),theory(equality)],[2,8]),
[iquote('0:Res:2.0,8.1')] ).
cnf(28,plain,
( ~ well_ordering(skc2)
| antisymmetric(skc2) ),
inference(res,[status(thm),theory(equality)],[2,9]),
[iquote('0:Res:2.0,9.1')] ).
cnf(29,plain,
( ~ well_ordering(skc2)
| connected(skc2) ),
inference(res,[status(thm),theory(equality)],[2,10]),
[iquote('0:Res:2.0,10.1')] ).
cnf(30,plain,
( ~ well_ordering(skc2)
| well_founded_relation(skc2) ),
inference(res,[status(thm),theory(equality)],[2,11]),
[iquote('0:Res:2.0,11.1')] ).
cnf(31,plain,
relation(relation_restriction(skc2,u)),
inference(res,[status(thm),theory(equality)],[2,6]),
[iquote('0:Res:2.0,6.0')] ).
cnf(37,plain,
reflexive(skc2),
inference(mrr,[status(thm)],[26,1]),
[iquote('0:MRR:26.0,1.0')] ).
cnf(38,plain,
transitive(skc2),
inference(mrr,[status(thm)],[27,1]),
[iquote('0:MRR:27.0,1.0')] ).
cnf(39,plain,
antisymmetric(skc2),
inference(mrr,[status(thm)],[28,1]),
[iquote('0:MRR:28.0,1.0')] ).
cnf(40,plain,
connected(skc2),
inference(mrr,[status(thm)],[29,1]),
[iquote('0:MRR:29.0,1.0')] ).
cnf(41,plain,
well_founded_relation(skc2),
inference(mrr,[status(thm)],[30,1]),
[iquote('0:MRR:30.0,1.0')] ).
cnf(42,plain,
reflexive(relation_restriction(skc2,u)),
inference(mrr,[status(thm)],[21,37]),
[iquote('0:MRR:21.0,37.0')] ).
cnf(43,plain,
connected(relation_restriction(skc2,u)),
inference(mrr,[status(thm)],[22,40]),
[iquote('0:MRR:22.0,40.0')] ).
cnf(44,plain,
transitive(relation_restriction(skc2,u)),
inference(mrr,[status(thm)],[23,38]),
[iquote('0:MRR:23.0,38.0')] ).
cnf(45,plain,
antisymmetric(relation_restriction(skc2,u)),
inference(mrr,[status(thm)],[24,39]),
[iquote('0:MRR:24.0,39.0')] ).
cnf(46,plain,
well_founded_relation(relation_restriction(skc2,u)),
inference(mrr,[status(thm)],[25,41]),
[iquote('0:MRR:25.0,41.0')] ).
cnf(60,plain,
( ~ relation(relation_restriction(skc2,skc3))
| ~ well_founded_relation(relation_restriction(skc2,skc3))
| ~ connected(relation_restriction(skc2,skc3))
| ~ antisymmetric(relation_restriction(skc2,skc3))
| ~ transitive(relation_restriction(skc2,skc3))
| ~ reflexive(relation_restriction(skc2,skc3)) ),
inference(res,[status(thm),theory(equality)],[18,3]),
[iquote('0:Res:18.6,3.0')] ).
cnf(61,plain,
$false,
inference(ssi,[status(thm)],[60,46,45,44,43,42,31]),
[iquote('0:SSi:60.5,60.4,60.3,60.2,60.1,60.0,46.0,45.0,44.0,43.0,42.0,31.0,46.0,45.0,44.0,43.0,42.0,31.0,46.0,45.0,44.0,43.0,42.0,31.0,46.0,45.0,44.0,43.0,42.0,31.0,46.0,45.0,44.0,43.0,42.0,31.0,46.0,45.0,44.0,43.0,42.0,31.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.12 % Command : run_spass %d %s
% 0.11/0.32 % Computer : n023.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Mon Jun 20 04:57:33 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.42
% 0.17/0.42 SPASS V 3.9
% 0.17/0.42 SPASS beiseite: Proof found.
% 0.17/0.42 % SZS status Theorem
% 0.17/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.42 SPASS derived 32 clauses, backtracked 0 clauses, performed 0 splits and kept 33 clauses.
% 0.17/0.42 SPASS allocated 97667 KBytes.
% 0.17/0.42 SPASS spent 0:00:00.09 on the problem.
% 0.17/0.42 0:00:00.04 for the input.
% 0.17/0.42 0:00:00.03 for the FLOTTER CNF translation.
% 0.17/0.42 0:00:00.00 for inferences.
% 0.17/0.42 0:00:00.00 for the backtracking.
% 0.17/0.42 0:00:00.00 for the reduction.
% 0.17/0.42
% 0.17/0.42
% 0.17/0.42 Here is a proof with depth 1, length 38 :
% 0.17/0.42 % SZS output start Refutation
% See solution above
% 0.17/0.42 Formulae used in the proof : t32_wellord1 dt_k2_wellord1 d4_wellord1 t22_wellord1 t23_wellord1 t24_wellord1 t25_wellord1 t31_wellord1
% 0.17/0.42
%------------------------------------------------------------------------------