%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PLA020-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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 : Mon Jul 18 17:32:20 EDT 2022
% Result : Unsatisfiable 0.18s 0.41s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 5 unt; 0 nHn; 8 RR)
% Number of literals : 14 ( 0 equ; 9 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ holds(clear(d),u),
file('PLA020-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ holds(empty,u)
| ~ holds(clear(v),u)
| ~ holds(on(v,w),u)
| holds(clear(w),do(pickup(v),u)) ),
file('PLA020-1.p',unknown),
[] ).
cnf(25,axiom,
holds(on(c,d),s0),
file('PLA020-1.p',unknown),
[] ).
cnf(29,axiom,
holds(clear(c),s0),
file('PLA020-1.p',unknown),
[] ).
cnf(30,axiom,
holds(empty,s0),
file('PLA020-1.p',unknown),
[] ).
cnf(35,plain,
( ~ holds(empty,u)
| ~ holds(clear(v),u)
| ~ holds(on(v,d),u) ),
inference(res,[status(thm),theory(equality)],[4,1]),
[iquote('0:Res:4.3,1.0')] ).
cnf(61,plain,
( ~ holds(empty,s0)
| ~ holds(clear(c),s0) ),
inference(res,[status(thm),theory(equality)],[25,35]),
[iquote('0:Res:25.0,35.2')] ).
cnf(63,plain,
$false,
inference(mrr,[status(thm)],[61,30,29]),
[iquote('0:MRR:61.0,61.1,30.0,29.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : PLA020-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n025.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 May 31 23:12:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.41
% 0.18/0.41 SPASS V 3.9
% 0.18/0.41 SPASS beiseite: Proof found.
% 0.18/0.41 % SZS status Theorem
% 0.18/0.41 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.41 SPASS derived 31 clauses, backtracked 0 clauses, performed 0 splits and kept 47 clauses.
% 0.18/0.41 SPASS allocated 63138 KBytes.
% 0.18/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.18/0.41 0:00:00.04 for the input.
% 0.18/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.41 0:00:00.00 for inferences.
% 0.18/0.41 0:00:00.00 for the backtracking.
% 0.18/0.41 0:00:00.00 for the reduction.
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 Here is a proof with depth 2, length 8 :
% 0.18/0.41 % SZS output start Refutation
% See solution above
% 0.18/0.41 Formulae used in the proof : prove_D pickup_2 initial_state3 initial_state7 initial_state8
% 0.18/0.41
%------------------------------------------------------------------------------