TSTP Solution File: SYN088-1.010 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN088-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 : n013.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:35 EDT 2023
% Result : Unsatisfiable 2.79s 1.61s
% Output : CNFRefutation 2.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 25
% Syntax : Number of formulae : 39 ( 23 unt; 13 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 61 ( 32 ~; 29 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 11 >; 9 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-10 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 20 (; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > q_9 > q_8 > q_7 > q_6 > q_5 > q_4 > q_3 > q_2 > q_10 > q_1 > #nlpp > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(q_8,type,
q_8: $i > $o ).
tff(q_10,type,
q_10: $i > $o ).
tff(q_6,type,
q_6: $i > $o ).
tff(a,type,
a: $i ).
tff(p,type,
p: ( $i * $i * $i * $i * $i * $i * $i * $i * $i * $i ) > $o ).
tff(q_1,type,
q_1: $i > $o ).
tff(q_2,type,
q_2: $i > $o ).
tff(q_7,type,
q_7: $i > $o ).
tff(b,type,
b: $i ).
tff(q_4,type,
q_4: $i > $o ).
tff(q_5,type,
q_5: $i > $o ).
tff(q_3,type,
q_3: $i > $o ).
tff(q_9,type,
q_9: $i > $o ).
tff(f_57,axiom,
q_1(a),
file(unknown,unknown) ).
tff(f_59,axiom,
q_2(a),
file(unknown,unknown) ).
tff(f_61,axiom,
q_3(a),
file(unknown,unknown) ).
tff(f_63,axiom,
q_4(a),
file(unknown,unknown) ).
tff(f_65,axiom,
q_5(a),
file(unknown,unknown) ).
tff(f_67,axiom,
q_6(a),
file(unknown,unknown) ).
tff(f_69,axiom,
q_7(a),
file(unknown,unknown) ).
tff(f_71,axiom,
q_8(a),
file(unknown,unknown) ).
tff(f_73,axiom,
q_9(a),
file(unknown,unknown) ).
tff(f_75,axiom,
q_10(a),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X_3,X_8,X_4,X_9,X_2,X_6,X_7,X_5,X_10,X_1] :
( p(X_1,X_2,X_3,X_4,X_5,X_6,X_7,X_8,X_9,X_10)
| ~ q_1(X_1)
| ~ q_2(X_2)
| ~ q_3(X_3)
| ~ q_4(X_4)
| ~ q_5(X_5)
| ~ q_6(X_6)
| ~ q_7(X_7)
| ~ q_8(X_8)
| ~ q_9(X_9)
| ~ q_10(X_10) ),
file(unknown,unknown) ).
tff(f_24,axiom,
~ p(a,a,a,a,a,a,a,a,a,a),
file(unknown,unknown) ).
tff(c_6,plain,
q_1(a),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_10,plain,
q_2(a),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_14,plain,
q_3(a),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_18,plain,
q_4(a),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_22,plain,
q_5(a),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_26,plain,
q_6(a),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_30,plain,
q_7(a),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_34,plain,
q_8(a),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_38,plain,
q_9(a),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_42,plain,
q_10(a),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_45,plain,
! [X_9_15,X_2_19,X_3_13,X_8_18,X_4_17,X_6_20,X_10_14,X_7_16,X_1_11,X_5_12] :
( ~ q_10(X_10_14)
| ~ q_9(X_9_15)
| ~ q_8(X_8_18)
| ~ q_7(X_7_16)
| ~ q_6(X_6_20)
| ~ q_5(X_5_12)
| ~ q_4(X_4_17)
| ~ q_3(X_3_13)
| ~ q_2(X_2_19)
| ~ q_1(X_1_11)
| p(X_1_11,X_2_19,X_3_13,X_4_17,X_5_12,X_6_20,X_7_16,X_8_18,X_9_15,X_10_14) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_2,plain,
~ p(a,a,a,a,a,a,a,a,a,a),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_48,plain,
( ~ q_10(a)
| ~ q_9(a)
| ~ q_8(a)
| ~ q_7(a)
| ~ q_6(a)
| ~ q_5(a)
| ~ q_4(a)
| ~ q_3(a)
| ~ q_2(a)
| ~ q_1(a) ),
inference(resolution,[status(thm)],[c_45,c_2]) ).
tff(c_52,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_10,c_14,c_18,c_22,c_26,c_30,c_34,c_38,c_42,c_48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN088-1.010 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % 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.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 17:29:32 EDT 2023
% 0.14/0.34 % CPUTime :
% 2.79/1.61 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.80/1.61
% 2.80/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.80/1.64
% 2.80/1.64 Inference rules
% 2.80/1.64 ----------------------
% 2.80/1.64 #Ref : 0
% 2.80/1.64 #Sup : 1
% 2.80/1.64 #Fact : 0
% 2.80/1.64 #Define : 0
% 2.80/1.64 #Split : 0
% 2.80/1.64 #Chain : 0
% 2.80/1.64 #Close : 0
% 2.80/1.64
% 2.80/1.64 Ordering : KBO
% 2.80/1.64
% 2.80/1.64 Simplification rules
% 2.80/1.64 ----------------------
% 2.80/1.64 #Subsume : 0
% 2.80/1.64 #Demod : 10
% 2.80/1.64 #Tautology : 0
% 2.80/1.64 #SimpNegUnit : 0
% 2.80/1.64 #BackRed : 0
% 2.80/1.64
% 2.80/1.64 #Partial instantiations: 0
% 2.80/1.64 #Strategies tried : 1
% 2.80/1.64
% 2.80/1.64 Timing (in seconds)
% 2.80/1.64 ----------------------
% 2.80/1.64 Preprocessing : 0.40
% 2.80/1.64 Parsing : 0.22
% 2.80/1.64 CNF conversion : 0.02
% 2.80/1.64 Main loop : 0.22
% 2.80/1.64 Inferencing : 0.10
% 2.80/1.64 Reduction : 0.06
% 2.80/1.64 Demodulation : 0.04
% 2.80/1.64 BG Simplification : 0.02
% 2.80/1.64 Subsumption : 0.03
% 2.80/1.64 Abstraction : 0.01
% 2.80/1.64 MUC search : 0.00
% 2.80/1.64 Cooper : 0.00
% 2.80/1.64 Total : 0.66
% 2.80/1.64 Index Insertion : 0.00
% 2.80/1.64 Index Deletion : 0.00
% 2.80/1.64 Index Matching : 0.00
% 2.80/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------