TSTP Solution File: SYN088-1.010 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN088-1.010 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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:18:31 EDT 2022
% Result : Unsatisfiable 0.12s 0.39s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 12
% Syntax : Number of clauses : 14 ( 12 unt; 0 nHn; 14 RR)
% Number of literals : 33 ( 0 equ; 21 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-10 aty)
% Number of functors : 11 ( 11 usr; 11 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ q_10(u)
| ~ q_9(v)
| ~ q_8(w)
| ~ q_7(x)
| ~ q_6(y)
| ~ q_5(z)
| ~ q_4(x1)
| ~ q_3(x2)
| ~ q_2(x3)
| ~ q_1(x4)
| p(x4,x3,x2,x1,z,y,x,w,v,u) ),
file('SYN088-1.010.p',unknown),
[] ).
cnf(2,axiom,
q_1(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(4,axiom,
q_2(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(6,axiom,
q_3(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(8,axiom,
q_4(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(10,axiom,
q_5(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(12,axiom,
q_6(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(14,axiom,
q_7(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(16,axiom,
q_8(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(18,axiom,
q_9(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(20,axiom,
q_10(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(22,axiom,
~ p(a,a,a,a,a,a,a,a,a,a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(23,plain,
( ~ q_1(a)
| ~ q_2(a)
| ~ q_3(a)
| ~ q_4(a)
| ~ q_5(a)
| ~ q_6(a)
| ~ q_7(a)
| ~ q_8(a)
| ~ q_9(a)
| ~ q_10(a) ),
inference(res,[status(thm),theory(equality)],[1,22]),
[iquote('0:Res:1.10,22.0')] ).
cnf(24,plain,
$false,
inference(mrr,[status(thm)],[23,2,4,6,8,10,12,14,16,18,20]),
[iquote('0:MRR:23.0,23.1,23.2,23.3,23.4,23.5,23.6,23.7,23.8,23.9,2.0,4.0,6.0,8.0,10.0,12.0,14.0,16.0,18.0,20.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYN088-1.010 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.32 % Computer : n007.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jul 12 08:12:18 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.39
% 0.12/0.39 SPASS V 3.9
% 0.12/0.39 SPASS beiseite: Proof found.
% 0.12/0.39 % SZS status Theorem
% 0.12/0.39 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.39 SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 23 clauses.
% 0.12/0.39 SPASS allocated 75611 KBytes.
% 0.12/0.39 SPASS spent 0:00:00.06 on the problem.
% 0.12/0.39 0:00:00.04 for the input.
% 0.12/0.39 0:00:00.00 for the FLOTTER CNF translation.
% 0.12/0.39 0:00:00.00 for inferences.
% 0.12/0.39 0:00:00.00 for the backtracking.
% 0.12/0.39 0:00:00.00 for the reduction.
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Here is a proof with depth 1, length 14 :
% 0.12/0.39 % SZS output start Refutation
% See solution above
% 0.12/0.39 Formulae used in the proof : s4_1 s4_2 s4_4 s4_6 s4_8 s4_10 s4_12 s4_14 s4_16 s4_18 s4_20 s4_goal_1
% 0.12/0.39
%------------------------------------------------------------------------------