TSTP Solution File: PUZ004-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ004-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %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 : 300s
% DateTime : Tue Aug 22 10:53:49 EDT 2023
% Result : Unsatisfiable 2.54s 1.83s
% Output : CNFRefutation 2.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 21
% Syntax : Number of formulae : 42 ( 14 unt; 10 typ; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 42 ( 24 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 usr; 11 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > on_one_sheet > on_blue_paper > in_third_person > in_black_ink > filed > dated > crossed > can_be_read > by_brown > begins_with_dear_sir
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(can_be_read,type,
can_be_read: $o ).
tff(on_one_sheet,type,
on_one_sheet: $o ).
tff(dated,type,
dated: $o ).
tff(on_blue_paper,type,
on_blue_paper: $o ).
tff(in_black_ink,type,
in_black_ink: $o ).
tff(in_third_person,type,
in_third_person: $o ).
tff(by_brown,type,
by_brown: $o ).
tff(filed,type,
filed: $o ).
tff(begins_with_dear_sir,type,
begins_with_dear_sir: $o ).
tff(crossed,type,
crossed: $o ).
tff(f_75,axiom,
can_be_read,
file(unknown,unknown) ).
tff(f_49,axiom,
( ~ can_be_read
| ~ filed ),
file(unknown,unknown) ).
tff(f_64,axiom,
( ~ on_blue_paper
| filed ),
file(unknown,unknown) ).
tff(f_74,axiom,
by_brown,
file(unknown,unknown) ).
tff(f_60,axiom,
( ~ by_brown
| begins_with_dear_sir ),
file(unknown,unknown) ).
tff(f_73,axiom,
( ~ begins_with_dear_sir
| ~ in_third_person ),
file(unknown,unknown) ).
tff(f_44,axiom,
( in_third_person
| ~ in_black_ink ),
file(unknown,unknown) ).
tff(f_56,axiom,
( crossed
| in_black_ink ),
file(unknown,unknown) ).
tff(f_68,axiom,
( on_one_sheet
| ~ crossed ),
file(unknown,unknown) ).
tff(f_53,axiom,
( ~ on_one_sheet
| dated ),
file(unknown,unknown) ).
tff(f_36,axiom,
( ~ dated
| on_blue_paper ),
file(unknown,unknown) ).
tff(c_24,plain,
can_be_read,
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_8,plain,
( ~ filed
| ~ can_be_read ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_30,plain,
~ filed,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_8]) ).
tff(c_16,plain,
( filed
| ~ on_blue_paper ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_31,plain,
~ on_blue_paper,
inference(negUnitSimplification,[status(thm)],[c_30,c_16]) ).
tff(c_22,plain,
by_brown,
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_14,plain,
( begins_with_dear_sir
| ~ by_brown ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_26,plain,
begins_with_dear_sir,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_14]) ).
tff(c_20,plain,
( ~ in_third_person
| ~ begins_with_dear_sir ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_28,plain,
~ in_third_person,
inference(demodulation,[status(thm),theory(equality)],[c_26,c_20]) ).
tff(c_6,plain,
( ~ in_black_ink
| in_third_person ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_32,plain,
~ in_black_ink,
inference(negUnitSimplification,[status(thm)],[c_28,c_6]) ).
tff(c_12,plain,
( in_black_ink
| crossed ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_33,plain,
crossed,
inference(negUnitSimplification,[status(thm)],[c_32,c_12]) ).
tff(c_18,plain,
( ~ crossed
| on_one_sheet ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_35,plain,
on_one_sheet,
inference(demodulation,[status(thm),theory(equality)],[c_33,c_18]) ).
tff(c_10,plain,
( dated
| ~ on_one_sheet ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_37,plain,
dated,
inference(demodulation,[status(thm),theory(equality)],[c_35,c_10]) ).
tff(c_2,plain,
( on_blue_paper
| ~ dated ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_40,plain,
on_blue_paper,
inference(demodulation,[status(thm),theory(equality)],[c_37,c_2]) ).
tff(c_41,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_31,c_40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : PUZ004-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.08 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.09/0.27 % Computer : n018.cluster.edu
% 0.09/0.27 % Model : x86_64 x86_64
% 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27 % Memory : 8042.1875MB
% 0.09/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.27 % CPULimit : 300
% 0.09/0.27 % WCLimit : 300
% 0.09/0.27 % DateTime : Thu Aug 3 17:46:50 EDT 2023
% 0.09/0.28 % CPUTime :
% 2.54/1.83 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.54/1.84
% 2.54/1.84 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.59/1.90
% 2.59/1.90 Inference rules
% 2.59/1.90 ----------------------
% 2.59/1.90 #Ref : 0
% 2.59/1.90 #Sup : 0
% 2.59/1.90 #Fact : 0
% 2.59/1.90 #Define : 0
% 2.59/1.90 #Split : 0
% 2.59/1.90 #Chain : 0
% 2.59/1.90 #Close : 0
% 2.59/1.90
% 2.59/1.90 Ordering : KBO
% 2.59/1.90
% 2.59/1.90 Simplification rules
% 2.59/1.90 ----------------------
% 2.59/1.90 #Subsume : 11
% 2.59/1.90 #Demod : 6
% 2.59/1.90 #Tautology : 0
% 2.59/1.90 #SimpNegUnit : 5
% 2.59/1.90 #BackRed : 0
% 2.59/1.90
% 2.59/1.90 #Partial instantiations: 0
% 2.59/1.90 #Strategies tried : 1
% 2.59/1.90
% 2.59/1.90 Timing (in seconds)
% 2.59/1.90 ----------------------
% 2.59/1.91 Preprocessing : 0.56
% 2.59/1.91 Parsing : 0.29
% 2.59/1.91 CNF conversion : 0.02
% 2.59/1.91 Main loop : 0.12
% 2.59/1.91 Inferencing : 0.00
% 2.59/1.91 Reduction : 0.05
% 2.59/1.91 Demodulation : 0.04
% 2.59/1.91 BG Simplification : 0.02
% 2.59/1.91 Subsumption : 0.06
% 2.59/1.91 Abstraction : 0.01
% 2.59/1.91 MUC search : 0.00
% 2.59/1.91 Cooper : 0.00
% 2.59/1.91 Total : 0.78
% 2.59/1.91 Index Insertion : 0.00
% 2.59/1.91 Index Deletion : 0.00
% 2.59/1.91 Index Matching : 0.00
% 2.59/1.91 BG Taut test : 0.00
%------------------------------------------------------------------------------