TSTP Solution File: SEU257+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU257+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:36 EDT 2022
% Result : Theorem 11.92s 12.13s
% Output : Refutation 11.92s
% 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(skc14),
file('SEU257+2.p',unknown),
[] ).
cnf(2,axiom,
relation(skc14),
file('SEU257+2.p',unknown),
[] ).
cnf(70,axiom,
~ well_ordering(relation_restriction(skc14,skc15)),
file('SEU257+2.p',unknown),
[] ).
cnf(139,axiom,
( ~ relation(u)
| relation(relation_restriction(u,v)) ),
file('SEU257+2.p',unknown),
[] ).
cnf(159,axiom,
( ~ relation(u)
| ~ well_ordering(u)
| reflexive(u) ),
file('SEU257+2.p',unknown),
[] ).
cnf(160,axiom,
( ~ relation(u)
| ~ well_ordering(u)
| transitive(u) ),
file('SEU257+2.p',unknown),
[] ).
cnf(161,axiom,
( ~ relation(u)
| ~ well_ordering(u)
| antisymmetric(u) ),
file('SEU257+2.p',unknown),
[] ).
cnf(162,axiom,
( ~ relation(u)
| ~ well_ordering(u)
| connected(u) ),
file('SEU257+2.p',unknown),
[] ).
cnf(163,axiom,
( ~ relation(u)
| ~ well_ordering(u)
| well_founded_relation(u) ),
file('SEU257+2.p',unknown),
[] ).
cnf(273,axiom,
( ~ relation(u)
| ~ reflexive(u)
| reflexive(relation_restriction(u,v)) ),
file('SEU257+2.p',unknown),
[] ).
cnf(274,axiom,
( ~ relation(u)
| ~ connected(u)
| connected(relation_restriction(u,v)) ),
file('SEU257+2.p',unknown),
[] ).
cnf(275,axiom,
( ~ relation(u)
| ~ transitive(u)
| transitive(relation_restriction(u,v)) ),
file('SEU257+2.p',unknown),
[] ).
cnf(276,axiom,
( ~ relation(u)
| ~ antisymmetric(u)
| antisymmetric(relation_restriction(u,v)) ),
file('SEU257+2.p',unknown),
[] ).
cnf(277,axiom,
( ~ relation(u)
| ~ well_founded_relation(u)
| well_founded_relation(relation_restriction(u,v)) ),
file('SEU257+2.p',unknown),
[] ).
cnf(528,axiom,
( ~ relation(u)
| ~ well_founded_relation(u)
| ~ connected(u)
| ~ antisymmetric(u)
| ~ transitive(u)
| ~ reflexive(u)
| well_ordering(u) ),
file('SEU257+2.p',unknown),
[] ).
cnf(937,plain,
( ~ reflexive(skc14)
| reflexive(relation_restriction(skc14,u)) ),
inference(res,[status(thm),theory(equality)],[2,273]),
[iquote('0:Res:2.0,273.1')] ).
cnf(938,plain,
( ~ connected(skc14)
| connected(relation_restriction(skc14,u)) ),
inference(res,[status(thm),theory(equality)],[2,274]),
[iquote('0:Res:2.0,274.1')] ).
cnf(939,plain,
( ~ transitive(skc14)
| transitive(relation_restriction(skc14,u)) ),
inference(res,[status(thm),theory(equality)],[2,275]),
[iquote('0:Res:2.0,275.1')] ).
cnf(940,plain,
( ~ antisymmetric(skc14)
| antisymmetric(relation_restriction(skc14,u)) ),
inference(res,[status(thm),theory(equality)],[2,276]),
[iquote('0:Res:2.0,276.1')] ).
cnf(941,plain,
( ~ well_founded_relation(skc14)
| well_founded_relation(relation_restriction(skc14,u)) ),
inference(res,[status(thm),theory(equality)],[2,277]),
[iquote('0:Res:2.0,277.1')] ).
cnf(952,plain,
( ~ well_ordering(skc14)
| reflexive(skc14) ),
inference(res,[status(thm),theory(equality)],[2,159]),
[iquote('0:Res:2.0,159.1')] ).
cnf(953,plain,
( ~ well_ordering(skc14)
| transitive(skc14) ),
inference(res,[status(thm),theory(equality)],[2,160]),
[iquote('0:Res:2.0,160.1')] ).
cnf(954,plain,
( ~ well_ordering(skc14)
| antisymmetric(skc14) ),
inference(res,[status(thm),theory(equality)],[2,161]),
[iquote('0:Res:2.0,161.1')] ).
cnf(955,plain,
( ~ well_ordering(skc14)
| connected(skc14) ),
inference(res,[status(thm),theory(equality)],[2,162]),
[iquote('0:Res:2.0,162.1')] ).
cnf(956,plain,
( ~ well_ordering(skc14)
| well_founded_relation(skc14) ),
inference(res,[status(thm),theory(equality)],[2,163]),
[iquote('0:Res:2.0,163.1')] ).
cnf(958,plain,
relation(relation_restriction(skc14,u)),
inference(res,[status(thm),theory(equality)],[2,139]),
[iquote('0:Res:2.0,139.0')] ).
cnf(1031,plain,
( ~ reflexive(relation_restriction(skc14,skc15))
| ~ transitive(relation_restriction(skc14,skc15))
| ~ antisymmetric(relation_restriction(skc14,skc15))
| ~ connected(relation_restriction(skc14,skc15))
| ~ well_founded_relation(relation_restriction(skc14,skc15))
| ~ relation(relation_restriction(skc14,skc15)) ),
inference(res,[status(thm),theory(equality)],[528,70]),
[iquote('0:Res:528.6,70.0')] ).
cnf(1033,plain,
reflexive(skc14),
inference(mrr,[status(thm)],[952,1]),
[iquote('0:MRR:952.0,1.0')] ).
cnf(1034,plain,
transitive(skc14),
inference(mrr,[status(thm)],[953,1]),
[iquote('0:MRR:953.0,1.0')] ).
cnf(1035,plain,
antisymmetric(skc14),
inference(mrr,[status(thm)],[954,1]),
[iquote('0:MRR:954.0,1.0')] ).
cnf(1036,plain,
connected(skc14),
inference(mrr,[status(thm)],[955,1]),
[iquote('0:MRR:955.0,1.0')] ).
cnf(1037,plain,
well_founded_relation(skc14),
inference(mrr,[status(thm)],[956,1]),
[iquote('0:MRR:956.0,1.0')] ).
cnf(1042,plain,
reflexive(relation_restriction(skc14,u)),
inference(mrr,[status(thm)],[937,1033]),
[iquote('0:MRR:937.0,1033.0')] ).
cnf(1043,plain,
connected(relation_restriction(skc14,u)),
inference(mrr,[status(thm)],[938,1036]),
[iquote('0:MRR:938.0,1036.0')] ).
cnf(1044,plain,
transitive(relation_restriction(skc14,u)),
inference(mrr,[status(thm)],[939,1034]),
[iquote('0:MRR:939.0,1034.0')] ).
cnf(1045,plain,
antisymmetric(relation_restriction(skc14,u)),
inference(mrr,[status(thm)],[940,1035]),
[iquote('0:MRR:940.0,1035.0')] ).
cnf(1046,plain,
well_founded_relation(relation_restriction(skc14,u)),
inference(mrr,[status(thm)],[941,1037]),
[iquote('0:MRR:941.0,1037.0')] ).
cnf(1057,plain,
$false,
inference(mrr,[status(thm)],[1031,1042,1044,1045,1043,1046,958]),
[iquote('0:MRR:1031.0,1031.1,1031.2,1031.3,1031.4,1031.5,1042.0,1044.0,1045.0,1043.0,1046.0,958.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU257+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n017.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 : 600
% 0.12/0.34 % DateTime : Sun Jun 19 18:14:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 11.92/12.13
% 11.92/12.13 SPASS V 3.9
% 11.92/12.13 SPASS beiseite: Proof found.
% 11.92/12.13 % SZS status Theorem
% 11.92/12.13 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.92/12.13 SPASS derived 338 clauses, backtracked 0 clauses, performed 0 splits and kept 881 clauses.
% 11.92/12.13 SPASS allocated 122719 KBytes.
% 11.92/12.13 SPASS spent 0:0:11.76 on the problem.
% 11.92/12.13 0:00:00.04 for the input.
% 11.92/12.13 0:0:11.41 for the FLOTTER CNF translation.
% 11.92/12.13 0:00:00.00 for inferences.
% 11.92/12.13 0:00:00.00 for the backtracking.
% 11.92/12.13 0:00:00.11 for the reduction.
% 11.92/12.13
% 11.92/12.13
% 11.92/12.13 Here is a proof with depth 1, length 38 :
% 11.92/12.13 % SZS output start Refutation
% See solution above
% 11.92/12.13 Formulae used in the proof : t32_wellord1 dt_k2_wellord1 d4_wellord1 t22_wellord1 t23_wellord1 t24_wellord1 t25_wellord1 t31_wellord1
% 11.92/12.13
%------------------------------------------------------------------------------