TSTP Solution File: SYN085-1.010 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN085-1.010 : 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 : n027.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:09:34 EDT 2023
% Result : Unsatisfiable 2.08s 1.44s
% Output : CNFRefutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 23
% Syntax : Number of formulae : 37 ( 24 unt; 11 typ; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 11 ( 1 avg)
% Number of connectives : 42 ( 22 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 12 ( 11 usr; 12 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > p_9 > p_8 > p_7 > p_6 > p_5 > p_4 > p_3 > p_2 > p_10 > p_1 > p_0
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p_2,type,
p_2: $o ).
tff(p_9,type,
p_9: $o ).
tff(p_5,type,
p_5: $o ).
tff(p_7,type,
p_7: $o ).
tff(p_6,type,
p_6: $o ).
tff(p_8,type,
p_8: $o ).
tff(p_10,type,
p_10: $o ).
tff(p_3,type,
p_3: $o ).
tff(p_1,type,
p_1: $o ).
tff(p_0,type,
p_0: $o ).
tff(p_4,type,
p_4: $o ).
tff(f_56,axiom,
p_1,
file(unknown,unknown) ).
tff(f_57,axiom,
p_2,
file(unknown,unknown) ).
tff(f_58,axiom,
p_3,
file(unknown,unknown) ).
tff(f_59,axiom,
p_4,
file(unknown,unknown) ).
tff(f_60,axiom,
p_5,
file(unknown,unknown) ).
tff(f_61,axiom,
p_6,
file(unknown,unknown) ).
tff(f_62,axiom,
p_7,
file(unknown,unknown) ).
tff(f_63,axiom,
p_8,
file(unknown,unknown) ).
tff(f_64,axiom,
p_9,
file(unknown,unknown) ).
tff(f_65,axiom,
p_10,
file(unknown,unknown) ).
tff(f_55,axiom,
( p_0
| ~ p_1
| ~ p_2
| ~ p_3
| ~ p_4
| ~ p_5
| ~ p_6
| ~ p_7
| ~ p_8
| ~ p_9
| ~ p_10 ),
file(unknown,unknown) ).
tff(f_24,axiom,
~ p_0,
file(unknown,unknown) ).
tff(c_6,plain,
p_1,
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_8,plain,
p_2,
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_10,plain,
p_3,
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_12,plain,
p_4,
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_14,plain,
p_5,
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_16,plain,
p_6,
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_18,plain,
p_7,
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_20,plain,
p_8,
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_22,plain,
p_9,
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_24,plain,
p_10,
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_4,plain,
( ~ p_10
| ~ p_9
| ~ p_8
| ~ p_7
| ~ p_6
| ~ p_5
| ~ p_4
| ~ p_3
| ~ p_2
| ~ p_1
| p_0 ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_26,plain,
p_0,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_8,c_10,c_12,c_14,c_16,c_18,c_20,c_22,c_24,c_4]) ).
tff(c_2,plain,
~ p_0,
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_28,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_26,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN085-1.010 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % 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.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 17:50:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.08/1.44 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.08/1.44
% 2.08/1.44 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.08/1.48
% 2.08/1.48 Inference rules
% 2.08/1.48 ----------------------
% 2.08/1.48 #Ref : 0
% 2.08/1.48 #Sup : 0
% 2.08/1.48 #Fact : 0
% 2.08/1.48 #Define : 0
% 2.08/1.48 #Split : 0
% 2.08/1.48 #Chain : 0
% 2.08/1.48 #Close : 0
% 2.08/1.48
% 2.08/1.48 Ordering : KBO
% 2.08/1.48
% 2.08/1.48 Simplification rules
% 2.08/1.48 ----------------------
% 2.08/1.48 #Subsume : 11
% 2.08/1.48 #Demod : 11
% 2.08/1.48 #Tautology : 0
% 2.08/1.48 #SimpNegUnit : 0
% 2.08/1.48 #BackRed : 0
% 2.08/1.48
% 2.08/1.48 #Partial instantiations: 0
% 2.08/1.48 #Strategies tried : 1
% 2.08/1.48
% 2.08/1.48 Timing (in seconds)
% 2.08/1.48 ----------------------
% 2.08/1.49 Preprocessing : 0.36
% 2.08/1.49 Parsing : 0.19
% 2.08/1.49 CNF conversion : 0.01
% 2.08/1.49 Main loop : 0.07
% 2.08/1.49 Inferencing : 0.00
% 2.08/1.49 Reduction : 0.03
% 2.08/1.49 Demodulation : 0.02
% 2.08/1.49 BG Simplification : 0.01
% 2.08/1.49 Subsumption : 0.02
% 2.08/1.49 Abstraction : 0.00
% 2.08/1.49 MUC search : 0.00
% 2.08/1.49 Cooper : 0.00
% 2.08/1.49 Total : 0.49
% 2.08/1.49 Index Insertion : 0.00
% 2.08/1.49 Index Deletion : 0.00
% 2.08/1.49 Index Matching : 0.00
% 2.08/1.49 BG Taut test : 0.00
%------------------------------------------------------------------------------