TSTP Solution File: PUZ003-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ003-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n009.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 : Tue Aug 22 10:53:49 EDT 2023
% Result : Unsatisfiable 2.56s 1.63s
% Output : CNFRefutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 32 ( 14 unt; 7 typ; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 47 ( 25 ~; 22 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 15 (; 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ shaved > member > #nlpp > petruchio > members > lorenzo > guido > cesare
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(petruchio,type,
petruchio: $i ).
tff(cesare,type,
cesare: $i ).
tff(member,type,
member: $i > $o ).
tff(guido,type,
guido: $i ).
tff(shaved,type,
shaved: ( $i * $i ) > $o ).
tff(members,type,
members: $i ).
tff(lorenzo,type,
lorenzo: $i ).
tff(f_50,axiom,
member(lorenzo),
file(unknown,unknown) ).
tff(f_51,axiom,
member(petruchio),
file(unknown,unknown) ).
tff(f_49,axiom,
member(guido),
file(unknown,unknown) ).
tff(f_52,axiom,
member(cesare),
file(unknown,unknown) ).
tff(f_53,axiom,
shaved(guido,cesare),
file(unknown,unknown) ).
tff(f_40,axiom,
! [X,Y] :
( ~ member(X)
| ~ member(Y)
| ~ shaved(X,Y)
| shaved(members,X) ),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X,Y] :
( ~ shaved(members,X)
| ~ member(Y)
| shaved(Y,X) ),
file(unknown,unknown) ).
tff(f_55,axiom,
~ shaved(petruchio,lorenzo),
file(unknown,unknown) ).
tff(c_8,plain,
member(lorenzo),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_10,plain,
member(petruchio),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_6,plain,
member(guido),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_12,plain,
member(cesare),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_14,plain,
shaved(guido,cesare),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_18,plain,
! [X_7,Y_8] :
( shaved(members,X_7)
| ~ shaved(X_7,Y_8)
| ~ member(Y_8)
| ~ member(X_7) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_20,plain,
( shaved(members,guido)
| ~ member(cesare)
| ~ member(guido) ),
inference(resolution,[status(thm)],[c_14,c_18]) ).
tff(c_23,plain,
shaved(members,guido),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_12,c_20]) ).
tff(c_4,plain,
! [Y_4,X_3] :
( shaved(Y_4,X_3)
| ~ member(Y_4)
| ~ shaved(members,X_3) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_32,plain,
! [Y_9] :
( shaved(Y_9,guido)
| ~ member(Y_9) ),
inference(resolution,[status(thm)],[c_23,c_4]) ).
tff(c_2,plain,
! [X_1,Y_2] :
( shaved(members,X_1)
| ~ shaved(X_1,Y_2)
| ~ member(Y_2)
| ~ member(X_1) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_34,plain,
! [Y_9] :
( shaved(members,Y_9)
| ~ member(guido)
| ~ member(Y_9) ),
inference(resolution,[status(thm)],[c_32,c_2]) ).
tff(c_43,plain,
! [Y_10] :
( shaved(members,Y_10)
| ~ member(Y_10) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_34]) ).
tff(c_47,plain,
! [Y_11,Y_12] :
( shaved(Y_11,Y_12)
| ~ member(Y_11)
| ~ member(Y_12) ),
inference(resolution,[status(thm)],[c_43,c_4]) ).
tff(c_16,plain,
~ shaved(petruchio,lorenzo),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_53,plain,
( ~ member(petruchio)
| ~ member(lorenzo) ),
inference(resolution,[status(thm)],[c_47,c_16]) ).
tff(c_58,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_10,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ003-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:32:54 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.56/1.63 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.70/1.64
% 2.70/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.79/1.67
% 2.79/1.67 Inference rules
% 2.79/1.67 ----------------------
% 2.79/1.67 #Ref : 0
% 2.79/1.67 #Sup : 8
% 2.79/1.67 #Fact : 0
% 2.79/1.67 #Define : 0
% 2.79/1.67 #Split : 1
% 2.79/1.67 #Chain : 0
% 2.79/1.67 #Close : 0
% 2.79/1.67
% 2.79/1.67 Ordering : KBO
% 2.79/1.67
% 2.79/1.67 Simplification rules
% 2.79/1.67 ----------------------
% 2.79/1.67 #Subsume : 3
% 2.79/1.67 #Demod : 6
% 2.79/1.67 #Tautology : 0
% 2.79/1.67 #SimpNegUnit : 0
% 2.79/1.67 #BackRed : 0
% 2.79/1.67
% 2.79/1.67 #Partial instantiations: 0
% 2.79/1.67 #Strategies tried : 1
% 2.79/1.67
% 2.79/1.67 Timing (in seconds)
% 2.79/1.67 ----------------------
% 2.79/1.67 Preprocessing : 0.39
% 2.79/1.67 Parsing : 0.22
% 2.79/1.67 CNF conversion : 0.02
% 2.79/1.67 Main loop : 0.20
% 2.79/1.67 Inferencing : 0.09
% 2.79/1.67 Reduction : 0.04
% 2.79/1.67 Demodulation : 0.03
% 2.79/1.67 BG Simplification : 0.01
% 2.79/1.67 Subsumption : 0.04
% 2.79/1.67 Abstraction : 0.01
% 2.79/1.67 MUC search : 0.00
% 2.79/1.67 Cooper : 0.00
% 2.79/1.67 Total : 0.64
% 2.79/1.67 Index Insertion : 0.00
% 2.79/1.67 Index Deletion : 0.00
% 2.79/1.67 Index Matching : 0.00
% 2.79/1.67 BG Taut test : 0.00
%------------------------------------------------------------------------------