TSTP Solution File: PLA006-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PLA006-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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:17 EDT 2022
% Result : Unsatisfiable 0.21s 0.42s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 8 unt; 0 nHn; 13 RR)
% Number of literals : 22 ( 0 equ; 15 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ holds(on(c,table),u),
file('PLA006-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ differ(u,table)
| ~ holds(empty,v)
| ~ holds(clear(u),v)
| holds(holding(u),do(pickup(u),v)) ),
file('PLA006-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ holds(clear(u),v)
| ~ holds(holding(w),v)
| holds(on(w,u),do(putdown(w,u),v)) ),
file('PLA006-1.p',unknown),
[] ).
cnf(21,axiom,
differ(c,table),
file('PLA006-1.p',unknown),
[] ).
cnf(29,axiom,
holds(clear(c),s0),
file('PLA006-1.p',unknown),
[] ).
cnf(30,axiom,
holds(empty,s0),
file('PLA006-1.p',unknown),
[] ).
cnf(31,axiom,
holds(clear(table),u),
file('PLA006-1.p',unknown),
[] ).
cnf(34,plain,
( ~ holds(holding(c),u)
| ~ holds(clear(table),u) ),
inference(res,[status(thm),theory(equality)],[8,1]),
[iquote('0:Res:8.2,1.0')] ).
cnf(35,plain,
~ holds(holding(c),u),
inference(mrr,[status(thm)],[34,31]),
[iquote('0:MRR:34.1,31.0')] ).
cnf(59,plain,
( ~ differ(c,table)
| ~ holds(empty,u)
| ~ holds(clear(c),u) ),
inference(res,[status(thm),theory(equality)],[3,35]),
[iquote('0:Res:3.3,35.0')] ).
cnf(60,plain,
( ~ holds(empty,u)
| ~ holds(clear(c),u) ),
inference(mrr,[status(thm)],[59,21]),
[iquote('0:MRR:59.0,21.0')] ).
cnf(61,plain,
~ holds(empty,s0),
inference(res,[status(thm),theory(equality)],[29,60]),
[iquote('0:Res:29.0,60.1')] ).
cnf(65,plain,
$false,
inference(mrr,[status(thm)],[61,30]),
[iquote('0:MRR:61.0,30.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PLA006-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue May 31 23:41:13 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.42
% 0.21/0.42 SPASS V 3.9
% 0.21/0.42 SPASS beiseite: Proof found.
% 0.21/0.42 % SZS status Theorem
% 0.21/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.42 SPASS derived 31 clauses, backtracked 0 clauses, performed 0 splits and kept 46 clauses.
% 0.21/0.42 SPASS allocated 63139 KBytes.
% 0.21/0.42 SPASS spent 0:00:00.06 on the problem.
% 0.21/0.42 0:00:00.04 for the input.
% 0.21/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.42 0:00:00.00 for inferences.
% 0.21/0.42 0:00:00.00 for the backtracking.
% 0.21/0.42 0:00:00.00 for the reduction.
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 Here is a proof with depth 3, length 13 :
% 0.21/0.42 % SZS output start Refutation
% See solution above
% 0.21/0.42 Formulae used in the proof : prove_CTable pickup_1 putdown_2 differ_c_table initial_state7 initial_state8 clear_table
% 0.21/0.42
%------------------------------------------------------------------------------