TSTP Solution File: PUZ003-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : PUZ003-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n001.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 : 300s
% DateTime : Thu Aug 31 13:10:49 EDT 2023
% Result : Unsatisfiable 0.21s 0.61s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ003-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.14/0.34 % Computer : n001.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat Aug 26 23:03:02 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.56 start to proof:theBenchmark
% 0.21/0.60 %-------------------------------------------
% 0.21/0.60 % File :CSE---1.6
% 0.21/0.60 % Problem :theBenchmark
% 0.21/0.60 % Transform :cnf
% 0.21/0.60 % Format :tptp:raw
% 0.21/0.60 % Command :java -jar mcs_scs.jar %d %s
% 0.21/0.60
% 0.21/0.60 % Result :Theorem 0.000000s
% 0.21/0.60 % Output :CNFRefutation 0.000000s
% 0.21/0.60 %-------------------------------------------
% 0.21/0.61 %--------------------------------------------------------------------------
% 0.21/0.61 % File : PUZ003-1 : TPTP v8.1.2. Released v1.0.0.
% 0.21/0.61 % Domain : Puzzles
% 0.21/0.61 % Problem : The Barber Puzzle
% 0.21/0.61 % Version : Especial.
% 0.21/0.61 % English : There is a barbers' club that obeys the following three
% 0.21/0.61 % conditions:
% 0.21/0.61 % (1) If any member A has shaved any other member B - whether
% 0.21/0.61 % himself or another - then all members have shaved A,
% 0.21/0.61 % though not necessarily at the same time.
% 0.21/0.61 % (2) Four of the members are named Guido, Lorenzo, Petrucio,
% 0.21/0.61 % and Cesare.
% 0.21/0.61 % (3) Guido has shaved Cesare.
% 0.21/0.61 % Prove Petrucio has shaved Lorenzo
% 0.21/0.61
% 0.21/0.61 % Refs :
% 0.21/0.61 % Source : [ANL]
% 0.21/0.61 % Names : barber.ver1.in [ANL]
% 0.21/0.61
% 0.21/0.61 % Status : Unsatisfiable
% 0.21/0.61 % Rating : 0.00 v2.0.0
% 0.21/0.61 % Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 8 RR)
% 0.21/0.61 % Number of literals : 13 ( 0 equ; 6 neg)
% 0.21/0.61 % Maximal clause size : 4 ( 1 avg)
% 0.21/0.61 % Maximal term depth : 1 ( 1 avg)
% 0.21/0.61 % Number of predicates : 2 ( 2 usr; 0 prp; 1-2 aty)
% 0.21/0.61 % Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% 0.21/0.61 % Number of variables : 4 ( 0 sgn)
% 0.21/0.61 % SPC : CNF_UNS_EPR_NEQ_HRN
% 0.21/0.61
% 0.21/0.61 % Comments :
% 0.21/0.61 %--------------------------------------------------------------------------
% 0.21/0.61 cnf(one_shaved_then_all_shaved,axiom,
% 0.21/0.61 ( ~ member(X)
% 0.21/0.61 | ~ member(Y)
% 0.21/0.61 | ~ shaved(X,Y)
% 0.21/0.61 | shaved(members,X) ) ).
% 0.21/0.61
% 0.21/0.61 cnf(all_shaved_then_one_shaved,axiom,
% 0.21/0.61 ( ~ shaved(members,X)
% 0.21/0.61 | ~ member(Y)
% 0.21/0.61 | shaved(Y,X) ) ).
% 0.21/0.61
% 0.21/0.61 cnf(guido,hypothesis,
% 0.21/0.61 member(guido) ).
% 0.21/0.61
% 0.21/0.61 cnf(lorenzo,hypothesis,
% 0.21/0.61 member(lorenzo) ).
% 0.21/0.61
% 0.21/0.61 cnf(petruchio,hypothesis,
% 0.21/0.61 member(petruchio) ).
% 0.21/0.61
% 0.21/0.61 cnf(cesare,hypothesis,
% 0.21/0.61 member(cesare) ).
% 0.21/0.61
% 0.21/0.61 cnf(guido_has_shaved_cesare,hypothesis,
% 0.21/0.61 shaved(guido,cesare) ).
% 0.21/0.61
% 0.21/0.61 cnf(prove_petruchio_has_shaved_lorenzo,negated_conjecture,
% 0.21/0.61 ~ shaved(petruchio,lorenzo) ).
% 0.21/0.61
% 0.21/0.61 %--------------------------------------------------------------------------
% 0.21/0.61 %-------------------------------------------
% 0.21/0.61 % Proof found
% 0.21/0.61 % SZS status Theorem for theBenchmark
% 0.21/0.61 % SZS output start Proof
% 0.21/0.61 %ClaNum:8(EqnAxiom:0)
% 0.21/0.61 %VarNum:9(SingletonVarNum:4)
% 0.21/0.61 %MaxLitNum:4
% 0.21/0.61 %MaxfuncDepth:0
% 0.21/0.61 %SharedTerms:11
% 0.21/0.61 %goalClause: 6
% 0.21/0.61 %singleGoalClaCount:1
% 0.21/0.61 [1]P1(a1)
% 0.21/0.61 [2]P1(a3)
% 0.21/0.61 [3]P1(a4)
% 0.21/0.61 [4]P1(a2)
% 0.21/0.61 [5]P2(a1,a2)
% 0.21/0.61 [6]~P2(a4,a3)
% 0.21/0.61 [7]~P1(x71)+P2(x71,x72)+~P2(a5,x72)
% 0.21/0.61 [8]~P1(x81)+~P2(x81,x82)+~P1(x82)+P2(a5,x81)
% 0.21/0.61 %EqnAxiom
% 0.21/0.61
% 0.21/0.61 %-------------------------------------------
% 0.21/0.61 cnf(12,plain,
% 0.21/0.61 (~P2(a5,a3)),
% 0.21/0.61 inference(scs_inference,[],[6,3,7])).
% 0.21/0.61 cnf(14,plain,
% 0.21/0.61 (P2(a5,a1)),
% 0.21/0.61 inference(scs_inference,[],[1,4,5,8])).
% 0.21/0.61 cnf(19,plain,
% 0.21/0.61 ($false),
% 0.21/0.61 inference(scs_inference,[],[1,12,2,14,8,7]),
% 0.21/0.61 ['proof']).
% 0.21/0.61 % SZS output end Proof
% 0.21/0.61 % Total time :0.000000s
%------------------------------------------------------------------------------