TSTP Solution File: SYN662-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN662-1 : TPTP v8.1.0. Released v2.5.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 : Thu Jul 21 12:23:31 EDT 2022
% Result : Unsatisfiable 1.83s 2.04s
% Output : Refutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 7 unt; 0 nHn; 13 RR)
% Number of literals : 22 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
p2(u,u),
file('SYN662-1.p',unknown),
[] ).
cnf(11,axiom,
p25(c33,c36),
file('SYN662-1.p',unknown),
[] ).
cnf(12,axiom,
p25(c32,c33),
file('SYN662-1.p',unknown),
[] ).
cnf(19,axiom,
~ p2(u,f16(u,f9(f17(c31)))),
file('SYN662-1.p',unknown),
[] ).
cnf(30,axiom,
( ~ p2(u,v)
| ~ p2(u,w)
| p2(w,v) ),
file('SYN662-1.p',unknown),
[] ).
cnf(39,axiom,
p2(f11(f4(c32),c34),f16(f11(f4(c33),c34),f9(f17(c31)))),
file('SYN662-1.p',unknown),
[] ).
cnf(50,axiom,
( ~ p25(u,c36)
| ~ p25(c32,u)
| p2(f11(f4(u),c34),f11(f4(c32),c34)) ),
file('SYN662-1.p',unknown),
[] ).
cnf(102,plain,
( ~ p2(u,v)
| p2(v,u) ),
inference(res,[status(thm),theory(equality)],[6,30]),
[iquote('0:Res:6.0,30.0')] ).
cnf(134,plain,
( ~ p2(f11(f4(c32),c34),u)
| p2(u,f16(f11(f4(c33),c34),f9(f17(c31)))) ),
inference(res,[status(thm),theory(equality)],[39,30]),
[iquote('0:Res:39.0,30.0')] ).
cnf(579,plain,
( ~ p25(u,c36)
| ~ p25(c32,u)
| p2(f11(f4(c32),c34),f11(f4(u),c34)) ),
inference(res,[status(thm),theory(equality)],[50,102]),
[iquote('0:Res:50.2,102.0')] ).
cnf(954,plain,
~ p2(f11(f4(c32),c34),f11(f4(c33),c34)),
inference(res,[status(thm),theory(equality)],[134,19]),
[iquote('0:Res:134.1,19.0')] ).
cnf(5665,plain,
( ~ p25(c33,c36)
| ~ p25(c32,c33) ),
inference(res,[status(thm),theory(equality)],[579,954]),
[iquote('0:Res:579.2,954.0')] ).
cnf(5668,plain,
$false,
inference(mrr,[status(thm)],[5665,11,12]),
[iquote('0:MRR:5665.0,5665.1,11.0,12.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN662-1 : TPTP v8.1.0. Released v2.5.0.
% 0.04/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 00:23:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.83/2.04
% 1.83/2.04 SPASS V 3.9
% 1.83/2.04 SPASS beiseite: Proof found.
% 1.83/2.04 % SZS status Theorem
% 1.83/2.04 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.83/2.04 SPASS derived 5424 clauses, backtracked 0 clauses, performed 0 splits and kept 2673 clauses.
% 1.83/2.04 SPASS allocated 79294 KBytes.
% 1.83/2.04 SPASS spent 0:00:01.68 on the problem.
% 1.83/2.04 0:00:00.04 for the input.
% 1.83/2.04 0:00:00.00 for the FLOTTER CNF translation.
% 1.83/2.04 0:00:00.05 for inferences.
% 1.83/2.04 0:00:00.00 for the backtracking.
% 1.83/2.04 0:00:01.55 for the reduction.
% 1.83/2.04
% 1.83/2.04
% 1.83/2.04 Here is a proof with depth 3, length 13 :
% 1.83/2.04 % SZS output start Refutation
% See solution above
% 1.83/2.04 Formulae used in the proof : p2_6 p25_11 p25_12 not_p2_19 p2_30 p2_39 p2_50
% 1.83/2.04
%------------------------------------------------------------------------------