TSTP Solution File: SYN032-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN032-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 : n021.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 11:08:33 EDT 2023
% Result : Unsatisfiable 1.97s 1.50s
% Output : CNFRefutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 37 ( 14 unt; 6 typ; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 20 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 7 ( 6 usr; 7 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > k > j > h > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c,type,
c: $o ).
tff(k,type,
k: $o ).
tff(h,type,
h: $o ).
tff(b,type,
b: $o ).
tff(a,type,
a: $o ).
tff(j,type,
j: $o ).
tff(f_46,axiom,
( c
| ~ h ),
file(unknown,unknown) ).
tff(f_56,axiom,
( ~ a
| ~ b ),
file(unknown,unknown) ).
tff(f_27,axiom,
( h
| a
| ~ j ),
file(unknown,unknown) ).
tff(f_32,axiom,
( h
| k
| j ),
file(unknown,unknown) ).
tff(f_38,axiom,
( h
| j
| ~ k ),
file(unknown,unknown) ).
tff(f_51,axiom,
( ~ h
| ~ c ),
file(unknown,unknown) ).
tff(f_42,axiom,
( b
| ~ a ),
file(unknown,unknown) ).
tff(c_10,plain,
( ~ h
| c ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_16,plain,
~ h,
inference(splitLeft,[status(thm)],[c_10]) ).
tff(c_14,plain,
( ~ b
| ~ a ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_15,plain,
~ a,
inference(splitLeft,[status(thm)],[c_14]) ).
tff(c_2,plain,
( ~ j
| a
| h ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_19,plain,
~ j,
inference(negUnitSimplification,[status(thm)],[c_16,c_15,c_2]) ).
tff(c_4,plain,
( j
| k
| h ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_17,plain,
( j
| k ),
inference(negUnitSimplification,[status(thm)],[c_16,c_4]) ).
tff(c_18,plain,
k,
inference(splitLeft,[status(thm)],[c_17]) ).
tff(c_6,plain,
( ~ k
| j
| h ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_21,plain,
( j
| h ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_6]) ).
tff(c_22,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_16,c_19,c_21]) ).
tff(c_23,plain,
j,
inference(splitRight,[status(thm)],[c_17]) ).
tff(c_26,plain,
( a
| h ),
inference(demodulation,[status(thm),theory(equality)],[c_23,c_2]) ).
tff(c_27,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_16,c_15,c_26]) ).
tff(c_29,plain,
h,
inference(splitRight,[status(thm)],[c_10]) ).
tff(c_28,plain,
c,
inference(splitRight,[status(thm)],[c_10]) ).
tff(c_12,plain,
( ~ c
| ~ h ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_31,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_29,c_28,c_12]) ).
tff(c_32,plain,
~ b,
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_33,plain,
a,
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_8,plain,
( ~ a
| b ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_37,plain,
b,
inference(demodulation,[status(thm),theory(equality)],[c_33,c_8]) ).
tff(c_38,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_32,c_37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN032-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.13/0.35 % Computer : n021.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 : 300
% 0.13/0.35 % DateTime : Thu Aug 3 17:08:36 EDT 2023
% 0.13/0.35 % CPUTime :
% 1.97/1.50 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.97/1.50
% 1.97/1.50 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 1.97/1.54
% 1.97/1.54 Inference rules
% 1.97/1.54 ----------------------
% 1.97/1.54 #Ref : 0
% 1.97/1.54 #Sup : 0
% 1.97/1.54 #Fact : 0
% 1.97/1.54 #Define : 0
% 1.97/1.54 #Split : 5
% 1.97/1.54 #Chain : 0
% 1.97/1.54 #Close : 0
% 1.97/1.54
% 1.97/1.54 Ordering : KBO
% 1.97/1.54
% 1.97/1.54 Simplification rules
% 1.97/1.54 ----------------------
% 1.97/1.54 #Subsume : 3
% 1.97/1.54 #Demod : 5
% 1.97/1.54 #Tautology : 0
% 1.97/1.54 #SimpNegUnit : 5
% 1.97/1.54 #BackRed : 0
% 1.97/1.54
% 1.97/1.54 #Partial instantiations: 0
% 1.97/1.54 #Strategies tried : 1
% 1.97/1.54
% 1.97/1.54 Timing (in seconds)
% 1.97/1.54 ----------------------
% 1.97/1.55 Preprocessing : 0.34
% 1.97/1.55 Parsing : 0.18
% 1.97/1.55 CNF conversion : 0.01
% 1.97/1.55 Main loop : 0.13
% 1.97/1.55 Inferencing : 0.04
% 1.97/1.55 Reduction : 0.03
% 1.97/1.55 Demodulation : 0.02
% 1.97/1.55 BG Simplification : 0.01
% 1.97/1.55 Subsumption : 0.03
% 1.97/1.55 Abstraction : 0.00
% 1.97/1.55 MUC search : 0.00
% 1.97/1.55 Cooper : 0.00
% 1.97/1.55 Total : 0.54
% 1.97/1.55 Index Insertion : 0.00
% 1.97/1.55 Index Deletion : 0.00
% 1.97/1.55 Index Matching : 0.00
% 1.97/1.55 BG Taut test : 0.00
%------------------------------------------------------------------------------