TSTP Solution File: SYN618-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN618-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:14 EDT 2022
% Result : Unsatisfiable 0.45s 0.65s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 21 ( 10 unt; 0 nHn; 21 RR)
% Number of literals : 44 ( 0 equ; 26 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 11 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
p5(u,u),
file('SYN618-1.p',unknown),
[] ).
cnf(5,axiom,
p2(u,u),
file('SYN618-1.p',unknown),
[] ).
cnf(8,axiom,
p13(c23,c21),
file('SYN618-1.p',unknown),
[] ).
cnf(9,axiom,
p13(c19,c23),
file('SYN618-1.p',unknown),
[] ).
cnf(12,axiom,
p2(c17,f3(c16)),
file('SYN618-1.p',unknown),
[] ).
cnf(16,axiom,
p5(f8(f3(c16),c23),f6(f7(c22))),
file('SYN618-1.p',unknown),
[] ).
cnf(17,axiom,
~ p5(f8(f3(c16),c20),f6(f7(c22))),
file('SYN618-1.p',unknown),
[] ).
cnf(22,axiom,
( ~ p5(u,v)
| ~ p5(u,w)
| p5(w,v) ),
file('SYN618-1.p',unknown),
[] ).
cnf(24,axiom,
( ~ p2(u,v)
| ~ p2(u,w)
| p2(w,v) ),
file('SYN618-1.p',unknown),
[] ).
cnf(30,axiom,
( ~ p5(u,v)
| ~ p2(w,x)
| p5(f8(w,u),f8(x,v)) ),
file('SYN618-1.p',unknown),
[] ).
cnf(31,axiom,
( ~ p13(u,c21)
| ~ p13(c19,u)
| ~ p5(f8(c17,u),f6(f7(c22)))
| p5(u,c20) ),
file('SYN618-1.p',unknown),
[] ).
cnf(49,plain,
( ~ p2(u,v)
| p2(v,u) ),
inference(res,[status(thm),theory(equality)],[5,24]),
[iquote('0:Res:5.0,24.0')] ).
cnf(53,plain,
p2(f3(c16),c17),
inference(res,[status(thm),theory(equality)],[12,49]),
[iquote('0:Res:12.0,49.0')] ).
cnf(63,plain,
( ~ p5(f8(f3(c16),c23),u)
| p5(u,f6(f7(c22))) ),
inference(res,[status(thm),theory(equality)],[16,22]),
[iquote('0:Res:16.0,22.0')] ).
cnf(180,plain,
( ~ p5(c23,u)
| ~ p2(f3(c16),v)
| p5(f8(v,u),f6(f7(c22))) ),
inference(res,[status(thm),theory(equality)],[30,63]),
[iquote('0:Res:30.2,63.0')] ).
cnf(600,plain,
( ~ p5(c23,c20)
| ~ p2(f3(c16),f3(c16)) ),
inference(res,[status(thm),theory(equality)],[180,17]),
[iquote('0:Res:180.2,17.0')] ).
cnf(601,plain,
( ~ p5(c23,u)
| ~ p2(f3(c16),c17)
| ~ p13(u,c21)
| ~ p13(c19,u)
| p5(u,c20) ),
inference(res,[status(thm),theory(equality)],[180,31]),
[iquote('0:Res:180.2,31.2')] ).
cnf(606,plain,
~ p5(c23,c20),
inference(mrr,[status(thm)],[600,5]),
[iquote('0:MRR:600.1,5.0')] ).
cnf(608,plain,
( ~ p5(c23,u)
| ~ p13(u,c21)
| ~ p13(c19,u)
| p5(u,c20) ),
inference(mrr,[status(thm)],[601,53]),
[iquote('0:MRR:601.1,53.0')] ).
cnf(1544,plain,
( ~ p13(c23,c21)
| ~ p13(c19,c23)
| p5(c23,c20) ),
inference(res,[status(thm),theory(equality)],[3,608]),
[iquote('0:Res:3.0,608.0')] ).
cnf(1547,plain,
$false,
inference(mrr,[status(thm)],[1544,8,9,606]),
[iquote('0:MRR:1544.0,1544.1,1544.2,8.0,9.0,606.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN618-1 : TPTP v8.1.0. Released v2.5.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 : Mon Jul 11 21:37:19 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.45/0.65
% 0.45/0.65 SPASS V 3.9
% 0.45/0.65 SPASS beiseite: Proof found.
% 0.45/0.65 % SZS status Theorem
% 0.45/0.65 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.65 SPASS derived 1456 clauses, backtracked 0 clauses, performed 0 splits and kept 656 clauses.
% 0.45/0.65 SPASS allocated 76607 KBytes.
% 0.45/0.65 SPASS spent 0:00:00.29 on the problem.
% 0.45/0.65 0:00:00.04 for the input.
% 0.45/0.65 0:00:00.00 for the FLOTTER CNF translation.
% 0.45/0.65 0:00:00.02 for inferences.
% 0.45/0.65 0:00:00.00 for the backtracking.
% 0.45/0.65 0:00:00.20 for the reduction.
% 0.45/0.65
% 0.45/0.65
% 0.45/0.65 Here is a proof with depth 4, length 21 :
% 0.45/0.65 % SZS output start Refutation
% See solution above
% 0.45/0.65 Formulae used in the proof : p5_3 p2_5 p13_8 p13_9 p2_12 p5_16 not_p5_17 p5_22 p2_24 p5_30 p5_31
% 0.45/0.65
%------------------------------------------------------------------------------