TSTP Solution File: PUZ003-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PUZ003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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 18:27:11 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 18 ( 10 unt; 0 nHn; 18 RR)
% Number of literals : 33 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ member(u)
| ~ member(v)
| ~ shaved(v,u)
| shaved(members,v) ),
file('PUZ003-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ member(u)
| ~ shaved(members,v)
| shaved(u,v) ),
file('PUZ003-1.p',unknown),
[] ).
cnf(3,axiom,
member(guido),
file('PUZ003-1.p',unknown),
[] ).
cnf(4,axiom,
member(lorenzo),
file('PUZ003-1.p',unknown),
[] ).
cnf(5,axiom,
member(petruchio),
file('PUZ003-1.p',unknown),
[] ).
cnf(6,axiom,
member(cesare),
file('PUZ003-1.p',unknown),
[] ).
cnf(7,axiom,
shaved(guido,cesare),
file('PUZ003-1.p',unknown),
[] ).
cnf(8,axiom,
~ shaved(petruchio,lorenzo),
file('PUZ003-1.p',unknown),
[] ).
cnf(9,plain,
( ~ member(petruchio)
| ~ shaved(members,lorenzo) ),
inference(res,[status(thm),theory(equality)],[2,8]),
[iquote('0:Res:2.2,8.0')] ).
cnf(10,plain,
~ shaved(members,lorenzo),
inference(mrr,[status(thm)],[9,5]),
[iquote('0:MRR:9.0,5.0')] ).
cnf(15,plain,
( ~ member(cesare)
| ~ member(guido)
| shaved(members,guido) ),
inference(res,[status(thm),theory(equality)],[7,1]),
[iquote('0:Res:7.0,1.2')] ).
cnf(16,plain,
shaved(members,guido),
inference(ssi,[status(thm)],[15,3,6]),
[iquote('0:SSi:15.1,15.0,3.0,6.0')] ).
cnf(17,plain,
( ~ member(u)
| shaved(u,guido) ),
inference(res,[status(thm),theory(equality)],[16,2]),
[iquote('0:Res:16.0,2.1')] ).
cnf(21,plain,
( ~ member(u)
| ~ member(guido)
| ~ member(u)
| shaved(members,u) ),
inference(res,[status(thm),theory(equality)],[17,1]),
[iquote('0:Res:17.1,1.2')] ).
cnf(22,plain,
( ~ member(guido)
| ~ member(u)
| shaved(members,u) ),
inference(obv,[status(thm),theory(equality)],[21]),
[iquote('0:Obv:21.0')] ).
cnf(23,plain,
( ~ member(u)
| shaved(members,u) ),
inference(ssi,[status(thm)],[22,3]),
[iquote('0:SSi:22.0,3.0')] ).
cnf(24,plain,
~ member(lorenzo),
inference(res,[status(thm),theory(equality)],[23,10]),
[iquote('0:Res:23.1,10.0')] ).
cnf(26,plain,
$false,
inference(ssi,[status(thm)],[24,4]),
[iquote('0:SSi:24.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PUZ003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun May 29 00:15:09 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.42
% 0.20/0.42 SPASS V 3.9
% 0.20/0.42 SPASS beiseite: Proof found.
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.42 SPASS derived 8 clauses, backtracked 0 clauses, performed 0 splits and kept 14 clauses.
% 0.20/0.42 SPASS allocated 75600 KBytes.
% 0.20/0.42 SPASS spent 0:00:00.06 on the problem.
% 0.20/0.42 0:00:00.04 for the input.
% 0.20/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.42 0:00:00.00 for inferences.
% 0.20/0.42 0:00:00.00 for the backtracking.
% 0.20/0.42 0:00:00.00 for the reduction.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Here is a proof with depth 4, length 18 :
% 0.20/0.42 % SZS output start Refutation
% See solution above
% 0.20/0.42 Formulae used in the proof : one_shaved_then_all_shaved all_shaved_then_one_shaved guido lorenzo petruchio cesare guido_has_shaved_cesare prove_petruchio_has_shaved_lorenzo
% 0.20/0.42
%------------------------------------------------------------------------------