TSTP Solution File: SET786-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET786-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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 05:28:39 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 3 unt; 3 nHn; 10 RR)
% Number of literals : 19 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ element(u,v)
| ~ element(v,u)
| ~ element(u,sk1) ),
file('SET786-1.p',unknown),
[] ).
cnf(2,axiom,
( element(u,sk1)
| element(u,sk2(u)) ),
file('SET786-1.p',unknown),
[] ).
cnf(3,axiom,
( element(u,sk1)
| element(sk2(u),u) ),
file('SET786-1.p',unknown),
[] ).
cnf(5,plain,
( ~ element(u,sk2(u))
| ~ element(sk2(u),sk1)
| element(u,sk1) ),
inference(res,[status(thm),theory(equality)],[3,1]),
[iquote('0:Res:3.1,1.0')] ).
cnf(6,plain,
( ~ element(sk2(u),sk1)
| element(u,sk1) ),
inference(mrr,[status(thm)],[5,2]),
[iquote('0:MRR:5.0,2.1')] ).
cnf(7,plain,
( element(sk1,sk1)
| element(sk1,sk1) ),
inference(res,[status(thm),theory(equality)],[3,6]),
[iquote('0:Res:3.1,6.0')] ).
cnf(8,plain,
element(sk1,sk1),
inference(obv,[status(thm),theory(equality)],[7]),
[iquote('0:Obv:7.0')] ).
cnf(9,plain,
( ~ element(sk1,sk1)
| ~ element(sk1,sk1) ),
inference(res,[status(thm),theory(equality)],[8,1]),
[iquote('0:Res:8.0,1.0')] ).
cnf(10,plain,
~ element(sk1,sk1),
inference(obv,[status(thm),theory(equality)],[9]),
[iquote('0:Obv:9.0')] ).
cnf(11,plain,
$false,
inference(mrr,[status(thm)],[10,8]),
[iquote('0:MRR:10.0,8.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET786-1 : TPTP v8.1.0. Released v2.5.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n016.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 : 600
% 0.14/0.35 % DateTime : Sun Jul 10 00:39:40 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.42
% 0.20/0.42 SPASS V 3.9
% 0.20/0.42 SPASS beiseite: Proof found.
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.42 SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 6 clauses.
% 0.20/0.42 SPASS allocated 63079 KBytes.
% 0.20/0.42 SPASS spent 0:00:00.05 on the problem.
% 0.20/0.42 0:00:00.03 for the input.
% 0.20/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.42 0:00:00.00 for inferences.
% 0.20/0.42 0:00:00.00 for the backtracking.
% 0.20/0.42 0:00:00.00 for the reduction.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Here is a proof with depth 3, length 10 :
% 0.20/0.42 % SZS output start Refutation
% See solution above
% 0.20/0.42 Formulae used in the proof : thm25_1 thm25_2 thm25_3
% 0.20/0.42
%------------------------------------------------------------------------------