TSTP Solution File: SYN567-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN567-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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:22:55 EDT 2022
% Result : Unsatisfiable 24.33s 24.55s
% Output : Refutation 24.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 19 ( 9 unt; 4 nHn; 19 RR)
% Number of literals : 40 ( 0 equ; 14 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
p2(u,u),
file('SYN567-1.p',unknown),
[] ).
cnf(2,axiom,
p5(u,u),
file('SYN567-1.p',unknown),
[] ).
cnf(3,axiom,
p5(f8(f6(u)),u),
file('SYN567-1.p',unknown),
[] ).
cnf(4,axiom,
~ p2(f6(c9),f3(f4(c10))),
file('SYN567-1.p',unknown),
[] ).
cnf(5,axiom,
~ p2(f6(c9),f3(f7(f4(c10)))),
file('SYN567-1.p',unknown),
[] ).
cnf(6,axiom,
~ p2(f6(c9),f3(f7(f7(f4(c10))))),
file('SYN567-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ p5(u,v)
| p2(f6(u),f6(v)) ),
file('SYN567-1.p',unknown),
[] ).
cnf(12,axiom,
~ p2(f6(c9),f3(f7(f7(f7(f4(c10)))))),
file('SYN567-1.p',unknown),
[] ).
cnf(13,axiom,
( ~ p2(u,v)
| ~ p2(u,w)
| p2(w,v) ),
file('SYN567-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ p5(u,v)
| ~ p5(u,w)
| p5(w,v) ),
file('SYN567-1.p',unknown),
[] ).
cnf(19,axiom,
( ~ p2(f6(f8(u)),u)
| p2(u,f3(f4(c10)))
| p2(u,f3(f7(f4(c10))))
| p2(u,f3(f7(f7(f4(c10)))))
| p2(u,f3(f7(f7(f7(f4(c10)))))) ),
file('SYN567-1.p',unknown),
[] ).
cnf(20,plain,
( ~ p5(u,v)
| p5(v,u) ),
inference(res,[status(thm),theory(equality)],[2,14]),
[iquote('0:Res:2.0,14.0')] ).
cnf(23,plain,
( ~ p2(u,v)
| p2(v,u) ),
inference(res,[status(thm),theory(equality)],[1,13]),
[iquote('0:Res:1.0,13.0')] ).
cnf(30,plain,
p5(u,f8(f6(u))),
inference(res,[status(thm),theory(equality)],[3,20]),
[iquote('0:Res:3.0,20.0')] ).
cnf(35,plain,
( ~ p5(u,v)
| p2(f6(v),f6(u)) ),
inference(res,[status(thm),theory(equality)],[10,23]),
[iquote('0:Res:10.1,23.0')] ).
cnf(89,plain,
( ~ p5(u,f8(f6(u)))
| p2(f6(u),f3(f4(c10)))
| p2(f6(u),f3(f7(f4(c10))))
| p2(f6(u),f3(f7(f7(f4(c10)))))
| p2(f6(u),f3(f7(f7(f7(f4(c10)))))) ),
inference(res,[status(thm),theory(equality)],[35,19]),
[iquote('0:Res:35.1,19.0')] ).
cnf(91,plain,
( p2(f6(u),f3(f4(c10)))
| p2(f6(u),f3(f7(f4(c10))))
| p2(f6(u),f3(f7(f7(f4(c10)))))
| p2(f6(u),f3(f7(f7(f7(f4(c10)))))) ),
inference(mrr,[status(thm)],[89,30]),
[iquote('0:MRR:89.0,30.0')] ).
cnf(35742,plain,
( p2(f6(c9),f3(f4(c10)))
| p2(f6(c9),f3(f7(f4(c10))))
| p2(f6(c9),f3(f7(f7(f4(c10))))) ),
inference(res,[status(thm),theory(equality)],[91,12]),
[iquote('0:Res:91.3,12.0')] ).
cnf(35825,plain,
$false,
inference(mrr,[status(thm)],[35742,4,5,6]),
[iquote('0:MRR:35742.0,35742.1,35742.2,4.0,5.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN567-1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n003.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 13:37:45 EDT 2022
% 0.13/0.33 % CPUTime :
% 24.33/24.55
% 24.33/24.55 SPASS V 3.9
% 24.33/24.55 SPASS beiseite: Proof found.
% 24.33/24.55 % SZS status Theorem
% 24.33/24.55 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 24.33/24.55 SPASS derived 35757 clauses, backtracked 0 clauses, performed 0 splits and kept 13808 clauses.
% 24.33/24.55 SPASS allocated 82183 KBytes.
% 24.33/24.55 SPASS spent 0:0:23.99 on the problem.
% 24.33/24.55 0:00:00.03 for the input.
% 24.33/24.55 0:00:00.00 for the FLOTTER CNF translation.
% 24.33/24.55 0:00:00.31 for inferences.
% 24.33/24.55 0:00:00.00 for the backtracking.
% 24.33/24.55 0:0:23.36 for the reduction.
% 24.33/24.55
% 24.33/24.55
% 24.33/24.55 Here is a proof with depth 4, length 19 :
% 24.33/24.55 % SZS output start Refutation
% See solution above
% 24.33/24.55 Formulae used in the proof : p2_1 p5_2 p5_3 not_p2_4 not_p2_5 not_p2_6 p2_10 not_p2_12 p2_13 p5_14 p2_19
% 24.33/24.55
%------------------------------------------------------------------------------