TSTP Solution File: SYN003-1.006 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN003-1.006 : 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 : n007.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:29 EDT 2023
% Result : Unsatisfiable 2.24s 1.50s
% Output : CNFRefutation 2.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 31
% Syntax : Number of formulae : 59 ( 17 unt; 18 typ; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 74 ( 40 ~; 34 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 : 19 ( 18 usr; 19 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > r_5 > r_4 > r_3 > r_2 > r_1 > r > q_5 > q_4 > q_3 > q_2 > q_1 > q > p_6 > p_5 > p_4 > p_3 > p_2 > p_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(q_5,type,
q_5: $o ).
tff(q_3,type,
q_3: $o ).
tff(q_1,type,
q_1: $o ).
tff(r_2,type,
r_2: $o ).
tff(p_2,type,
p_2: $o ).
tff(r_5,type,
r_5: $o ).
tff(p_5,type,
p_5: $o ).
tff(q,type,
q: $o ).
tff(q_4,type,
q_4: $o ).
tff(r_1,type,
r_1: $o ).
tff(q_2,type,
q_2: $o ).
tff(p_6,type,
p_6: $o ).
tff(r_4,type,
r_4: $o ).
tff(p_3,type,
p_3: $o ).
tff(p_1,type,
p_1: $o ).
tff(r_3,type,
r_3: $o ).
tff(r,type,
r: $o ).
tff(p_4,type,
p_4: $o ).
tff(f_145,axiom,
~ p_6,
file(unknown,unknown) ).
tff(f_147,axiom,
r,
file(unknown,unknown) ).
tff(f_142,axiom,
( ~ r
| r_5 ),
file(unknown,unknown) ).
tff(f_102,axiom,
( ~ p_5
| ~ r_5
| p_6 ),
file(unknown,unknown) ).
tff(f_138,axiom,
( ~ r
| r_4 ),
file(unknown,unknown) ).
tff(f_95,axiom,
( ~ p_4
| ~ r_4
| p_5 ),
file(unknown,unknown) ).
tff(f_134,axiom,
( ~ r
| r_3 ),
file(unknown,unknown) ).
tff(f_88,axiom,
( ~ p_3
| ~ r_3
| p_4 ),
file(unknown,unknown) ).
tff(f_130,axiom,
( ~ r
| r_2 ),
file(unknown,unknown) ).
tff(f_81,axiom,
( ~ p_2
| ~ r_2
| p_3 ),
file(unknown,unknown) ).
tff(f_143,axiom,
p_1,
file(unknown,unknown) ).
tff(f_126,axiom,
( ~ r
| r_1 ),
file(unknown,unknown) ).
tff(f_74,axiom,
( ~ p_1
| ~ r_1
| p_2 ),
file(unknown,unknown) ).
tff(c_44,plain,
~ p_6,
inference(cnfTransformation,[status(thm)],[f_145]) ).
tff(c_48,plain,
r,
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_40,plain,
( r_5
| ~ r ),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_50,plain,
r_5,
inference(demodulation,[status(thm),theory(equality)],[c_48,c_40]) ).
tff(c_20,plain,
( p_6
| ~ r_5
| ~ p_5 ),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_70,plain,
( p_6
| ~ p_5 ),
inference(demodulation,[status(thm),theory(equality)],[c_50,c_20]) ).
tff(c_71,plain,
~ p_5,
inference(negUnitSimplification,[status(thm)],[c_44,c_70]) ).
tff(c_38,plain,
( r_4
| ~ r ),
inference(cnfTransformation,[status(thm)],[f_138]) ).
tff(c_52,plain,
r_4,
inference(demodulation,[status(thm),theory(equality)],[c_48,c_38]) ).
tff(c_18,plain,
( p_5
| ~ r_4
| ~ p_4 ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_73,plain,
( p_5
| ~ p_4 ),
inference(demodulation,[status(thm),theory(equality)],[c_52,c_18]) ).
tff(c_74,plain,
~ p_4,
inference(negUnitSimplification,[status(thm)],[c_71,c_73]) ).
tff(c_36,plain,
( r_3
| ~ r ),
inference(cnfTransformation,[status(thm)],[f_134]) ).
tff(c_54,plain,
r_3,
inference(demodulation,[status(thm),theory(equality)],[c_48,c_36]) ).
tff(c_16,plain,
( p_4
| ~ r_3
| ~ p_3 ),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_76,plain,
( p_4
| ~ p_3 ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_16]) ).
tff(c_77,plain,
~ p_3,
inference(negUnitSimplification,[status(thm)],[c_74,c_76]) ).
tff(c_34,plain,
( r_2
| ~ r ),
inference(cnfTransformation,[status(thm)],[f_130]) ).
tff(c_56,plain,
r_2,
inference(demodulation,[status(thm),theory(equality)],[c_48,c_34]) ).
tff(c_14,plain,
( p_3
| ~ r_2
| ~ p_2 ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_79,plain,
( p_3
| ~ p_2 ),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_14]) ).
tff(c_80,plain,
~ p_2,
inference(negUnitSimplification,[status(thm)],[c_77,c_79]) ).
tff(c_42,plain,
p_1,
inference(cnfTransformation,[status(thm)],[f_143]) ).
tff(c_32,plain,
( r_1
| ~ r ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_58,plain,
r_1,
inference(demodulation,[status(thm),theory(equality)],[c_48,c_32]) ).
tff(c_12,plain,
( p_2
| ~ r_1
| ~ p_1 ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_82,plain,
p_2,
inference(demodulation,[status(thm),theory(equality)],[c_42,c_58,c_12]) ).
tff(c_83,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_80,c_82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN003-1.006 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.15 % 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.15/0.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 16:55:53 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.24/1.50 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.24/1.51
% 2.24/1.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.24/1.55
% 2.24/1.55 Inference rules
% 2.24/1.55 ----------------------
% 2.24/1.55 #Ref : 0
% 2.24/1.55 #Sup : 0
% 2.24/1.55 #Fact : 0
% 2.24/1.55 #Define : 0
% 2.24/1.55 #Split : 0
% 2.24/1.55 #Chain : 0
% 2.24/1.55 #Close : 0
% 2.24/1.55
% 2.24/1.55 Ordering : KBO
% 2.24/1.55
% 2.24/1.55 Simplification rules
% 2.24/1.55 ----------------------
% 2.24/1.55 #Subsume : 23
% 2.24/1.55 #Demod : 16
% 2.24/1.55 #Tautology : 0
% 2.24/1.55 #SimpNegUnit : 5
% 2.24/1.55 #BackRed : 0
% 2.24/1.55
% 2.24/1.55 #Partial instantiations: 0
% 2.24/1.55 #Strategies tried : 1
% 2.24/1.55
% 2.24/1.55 Timing (in seconds)
% 2.24/1.55 ----------------------
% 2.24/1.56 Preprocessing : 0.40
% 2.24/1.56 Parsing : 0.21
% 2.24/1.56 CNF conversion : 0.02
% 2.24/1.56 Main loop : 0.08
% 2.24/1.56 Inferencing : 0.00
% 2.24/1.56 Reduction : 0.04
% 2.24/1.56 Demodulation : 0.03
% 2.24/1.56 BG Simplification : 0.02
% 2.24/1.56 Subsumption : 0.03
% 2.24/1.56 Abstraction : 0.01
% 2.24/1.56 MUC search : 0.00
% 2.24/1.56 Cooper : 0.00
% 2.24/1.56 Total : 0.54
% 2.24/1.56 Index Insertion : 0.00
% 2.24/1.56 Index Deletion : 0.00
% 2.24/1.56 Index Matching : 0.00
% 2.24/1.56 BG Taut test : 0.00
%------------------------------------------------------------------------------