TSTP Solution File: GEO081-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO081-1 : TPTP v8.1.2. Released v2.4.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 : n011.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:38:07 EDT 2023
% Result : Unsatisfiable 47.43s 33.07s
% Output : CNFRefutation 47.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 30
% Syntax : Number of formulae : 43 ( 8 unt; 24 typ; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 34 ( 16 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 40 ( 21 >; 19 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 3 con; 0-3 aty)
% Number of variables : 27 (; 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > part_of > inner_point > incident_c > end_point > open > closed > ax0_sk5 > ax0_sk2 > sum > ax0_sk9 > ax0_sk4 > ax0_sk3 > ax0_sk13 > ax0_sk12 > ax0_sk11 > ax0_sk10 > ax0_sk1 > #nlpp > ax0_sk8 > ax0_sk7 > ax0_sk6 > sk16 > sk15 > sk14
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(closed,type,
closed: $i > $o ).
tff(ax0_sk8,type,
ax0_sk8: $i > $i ).
tff(ax0_sk9,type,
ax0_sk9: ( $i * $i ) > $i ).
tff(inner_point,type,
inner_point: ( $i * $i ) > $o ).
tff(sk16,type,
sk16: $i ).
tff(end_point,type,
end_point: ( $i * $i ) > $o ).
tff(ax0_sk12,type,
ax0_sk12: ( $i * $i ) > $i ).
tff(ax0_sk13,type,
ax0_sk13: ( $i * $i ) > $i ).
tff(part_of,type,
part_of: ( $i * $i ) > $o ).
tff(meet,type,
meet: ( $i * $i * $i ) > $o ).
tff(ax0_sk4,type,
ax0_sk4: ( $i * $i ) > $i ).
tff(incident_c,type,
incident_c: ( $i * $i ) > $o ).
tff(sum,type,
sum: ( $i * $i ) > $i ).
tff(ax0_sk11,type,
ax0_sk11: ( $i * $i ) > $i ).
tff(sk14,type,
sk14: $i ).
tff(ax0_sk1,type,
ax0_sk1: ( $i * $i ) > $i ).
tff(ax0_sk2,type,
ax0_sk2: ( $i * $i * $i ) > $i ).
tff(sk15,type,
sk15: $i ).
tff(ax0_sk7,type,
ax0_sk7: $i > $i ).
tff(ax0_sk10,type,
ax0_sk10: ( $i * $i ) > $i ).
tff(ax0_sk3,type,
ax0_sk3: ( $i * $i ) > $i ).
tff(ax0_sk5,type,
ax0_sk5: ( $i * $i * $i ) > $i ).
tff(ax0_sk6,type,
ax0_sk6: $i > $i ).
tff(open,type,
open: $i > $o ).
tff(f_433,axiom,
part_of(sk14,sk15),
file(unknown,unknown) ).
tff(f_434,axiom,
part_of(sk15,sk16),
file(unknown,unknown) ).
tff(f_56,axiom,
! [A,B] :
( incident_c(ax0_sk1(A,B),A)
| part_of(A,B) ),
file(unknown,unknown) ).
tff(f_52,axiom,
! [A,B,C] :
( ~ part_of(A,B)
| ~ incident_c(C,A)
| incident_c(C,B) ),
file(unknown,unknown) ).
tff(f_61,axiom,
! [A,B] :
( ~ incident_c(ax0_sk1(A,B),B)
| part_of(A,B) ),
file(unknown,unknown) ).
tff(f_436,axiom,
~ part_of(sk14,sk16),
file(unknown,unknown) ).
tff(c_98,plain,
part_of(sk14,sk15),
inference(cnfTransformation,[status(thm)],[f_433]) ).
tff(c_100,plain,
part_of(sk15,sk16),
inference(cnfTransformation,[status(thm)],[f_434]) ).
tff(c_4,plain,
! [A_4,B_5] :
( part_of(A_4,B_5)
| incident_c(ax0_sk1(A_4,B_5),A_4) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_229,plain,
! [C_167,B_168,A_169] :
( incident_c(C_167,B_168)
| ~ incident_c(C_167,A_169)
| ~ part_of(A_169,B_168) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_455,plain,
! [A_226,B_227,B_228] :
( incident_c(ax0_sk1(A_226,B_227),B_228)
| ~ part_of(A_226,B_228)
| part_of(A_226,B_227) ),
inference(resolution,[status(thm)],[c_4,c_229]) ).
tff(c_2,plain,
! [C_3,B_2,A_1] :
( incident_c(C_3,B_2)
| ~ incident_c(C_3,A_1)
| ~ part_of(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_527088,plain,
! [A_193582,B_193583,B_193584,B_193585] :
( incident_c(ax0_sk1(A_193582,B_193583),B_193584)
| ~ part_of(B_193585,B_193584)
| ~ part_of(A_193582,B_193585)
| part_of(A_193582,B_193583) ),
inference(resolution,[status(thm)],[c_455,c_2]) ).
tff(c_531761,plain,
! [A_197065,B_197066] :
( incident_c(ax0_sk1(A_197065,B_197066),sk16)
| ~ part_of(A_197065,sk15)
| part_of(A_197065,B_197066) ),
inference(resolution,[status(thm)],[c_100,c_527088]) ).
tff(c_6,plain,
! [A_6,B_7] :
( part_of(A_6,B_7)
| ~ incident_c(ax0_sk1(A_6,B_7),B_7) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_532039,plain,
! [A_197283] :
( ~ part_of(A_197283,sk15)
| part_of(A_197283,sk16) ),
inference(resolution,[status(thm)],[c_531761,c_6]) ).
tff(c_102,plain,
~ part_of(sk14,sk16),
inference(cnfTransformation,[status(thm)],[f_436]) ).
tff(c_532200,plain,
~ part_of(sk14,sk15),
inference(resolution,[status(thm)],[c_532039,c_102]) ).
tff(c_532312,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_98,c_532200]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO081-1 : TPTP v8.1.2. Released v2.4.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.13/0.35 % Computer : n011.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 : Fri Aug 4 00:23:36 EDT 2023
% 0.13/0.35 % CPUTime :
% 47.43/33.07 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 47.43/33.07
% 47.43/33.07 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 47.43/33.10
% 47.43/33.10 Inference rules
% 47.43/33.10 ----------------------
% 47.43/33.10 #Ref : 0
% 47.43/33.10 #Sup : 108611
% 47.43/33.10 #Fact : 114
% 47.43/33.10 #Define : 0
% 47.43/33.10 #Split : 9
% 47.43/33.10 #Chain : 0
% 47.43/33.10 #Close : 0
% 47.43/33.10
% 47.43/33.10 Ordering : KBO
% 47.43/33.10
% 47.43/33.10 Simplification rules
% 47.43/33.10 ----------------------
% 47.43/33.10 #Subsume : 68754
% 47.43/33.10 #Demod : 12392
% 47.43/33.10 #Tautology : 9275
% 47.43/33.10 #SimpNegUnit : 17
% 47.43/33.10 #BackRed : 8
% 47.43/33.10
% 47.43/33.10 #Partial instantiations: 123165
% 47.43/33.10 #Strategies tried : 1
% 47.43/33.10
% 47.43/33.10 Timing (in seconds)
% 47.43/33.10 ----------------------
% 47.43/33.10 Preprocessing : 0.61
% 47.43/33.10 Parsing : 0.32
% 47.43/33.10 CNF conversion : 0.04
% 47.43/33.10 Main loop : 31.48
% 47.43/33.11 Inferencing : 5.70
% 47.43/33.11 Reduction : 6.47
% 47.43/33.11 Demodulation : 4.18
% 47.43/33.11 BG Simplification : 0.33
% 47.43/33.11 Subsumption : 17.33
% 47.43/33.11 Abstraction : 0.58
% 47.43/33.11 MUC search : 0.00
% 47.43/33.11 Cooper : 0.00
% 47.43/33.11 Total : 32.14
% 47.43/33.11 Index Insertion : 0.00
% 47.43/33.11 Index Deletion : 0.00
% 47.43/33.11 Index Matching : 0.00
% 47.43/33.11 BG Taut test : 0.00
%------------------------------------------------------------------------------