TSTP Solution File: GEO147-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO147-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/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 : n003.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:17 EDT 2023
% Result : Unsatisfiable 6.86s 2.77s
% Output : CNFRefutation 6.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 56
% Syntax : Number of formulae : 77 ( 12 unt; 49 typ; 0 def)
% Number of atoms : 44 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 39 ( 23 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 98 ( 46 >; 52 *; 0 +; 0 <<)
% Number of predicates : 17 ( 15 usr; 1 prp; 0-4 aty)
% Number of functors : 34 ( 34 usr; 3 con; 0-5 aty)
% Number of variables : 33 (; 33 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ between_o > between_c > ordered_by > meet > connect > start_point > part_of > inner_point > incident_o > incident_c > finish_point > end_point > open > once > closed > ax2_sk5 > ax2_sk4 > ax1_sk1 > ax2_sk7 > ax0_sk5 > ax0_sk2 > sum > ax3_sk2 > ax2_sk9 > ax2_sk8 > ax2_sk2 > ax2_sk10 > ax2_sk1 > ax0_sk9 > ax0_sk4 > ax0_sk3 > ax0_sk13 > ax0_sk12 > ax0_sk11 > ax0_sk10 > ax0_sk1 > at_the_same_time > at > #nlpp > underlying_curve > trajectory_of > ax3_sk1 > ax2_sk6 > ax2_sk3 > ax0_sk8 > ax0_sk7 > ax0_sk6 > sk29 > sk28 > sk27
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ax2_sk6,type,
ax2_sk6: $i > $i ).
tff(once,type,
once: $i > $o ).
tff(underlying_curve,type,
underlying_curve: $i > $i ).
tff(ax2_sk10,type,
ax2_sk10: ( $i * $i ) > $i ).
tff(between_c,type,
between_c: ( $i * $i * $i * $i ) > $o ).
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(trajectory_of,type,
trajectory_of: $i > $i ).
tff(sk29,type,
sk29: $i ).
tff(end_point,type,
end_point: ( $i * $i ) > $o ).
tff(finish_point,type,
finish_point: ( $i * $i ) > $o ).
tff(ax2_sk1,type,
ax2_sk1: ( $i * $i ) > $i ).
tff(start_point,type,
start_point: ( $i * $i ) > $o ).
tff(ax0_sk12,type,
ax0_sk12: ( $i * $i ) > $i ).
tff(at_the_same_time,type,
at_the_same_time: ( $i * $i ) > $i ).
tff(ax0_sk13,type,
ax0_sk13: ( $i * $i ) > $i ).
tff(part_of,type,
part_of: ( $i * $i ) > $o ).
tff(between_o,type,
between_o: ( $i * $i * $i * $i ) > $o ).
tff(sk27,type,
sk27: $i ).
tff(meet,type,
meet: ( $i * $i * $i ) > $o ).
tff(at,type,
at: ( $i * $i ) > $i ).
tff(ax2_sk7,type,
ax2_sk7: ( $i * $i * $i ) > $i ).
tff(ax0_sk4,type,
ax0_sk4: ( $i * $i ) > $i ).
tff(ax2_sk4,type,
ax2_sk4: ( $i * $i * $i * $i ) > $i ).
tff(incident_c,type,
incident_c: ( $i * $i ) > $o ).
tff(ax2_sk9,type,
ax2_sk9: ( $i * $i ) > $i ).
tff(connect,type,
connect: ( $i * $i * $i ) > $o ).
tff(sum,type,
sum: ( $i * $i ) > $i ).
tff(sk28,type,
sk28: $i ).
tff(ordered_by,type,
ordered_by: ( $i * $i * $i ) > $o ).
tff(ax2_sk2,type,
ax2_sk2: ( $i * $i ) > $i ).
tff(ax3_sk2,type,
ax3_sk2: ( $i * $i ) > $i ).
tff(ax0_sk11,type,
ax0_sk11: ( $i * $i ) > $i ).
tff(ax2_sk5,type,
ax2_sk5: ( $i * $i * $i * $i * $i ) > $i ).
tff(incident_o,type,
incident_o: ( $i * $i ) > $o ).
tff(ax0_sk1,type,
ax0_sk1: ( $i * $i ) > $i ).
tff(ax0_sk2,type,
ax0_sk2: ( $i * $i * $i ) > $i ).
tff(ax0_sk7,type,
ax0_sk7: $i > $i ).
tff(ax3_sk1,type,
ax3_sk1: $i > $i ).
tff(ax0_sk10,type,
ax0_sk10: ( $i * $i ) > $i ).
tff(ax1_sk1,type,
ax1_sk1: ( $i * $i * $i * $i ) > $i ).
tff(ax2_sk8,type,
ax2_sk8: ( $i * $i ) > $i ).
tff(ax2_sk3,type,
ax2_sk3: $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_923,axiom,
! [A] : ( trajectory_of(A) = ax3_sk1(A) ),
file(unknown,unknown) ).
tff(f_916,axiom,
! [A,B] :
( ~ once(at(A,B))
| incident_o(B,trajectory_of(A)) ),
file(unknown,unknown) ).
tff(f_948,axiom,
( ~ incident_o(sk27,trajectory_of(sk28))
| ~ incident_o(sk27,trajectory_of(sk29)) ),
file(unknown,unknown) ).
tff(f_943,axiom,
connect(sk28,sk29,sk27),
file(unknown,unknown) ).
tff(f_871,axiom,
! [A,B,C] :
( ~ connect(A,B,C)
| once(at_the_same_time(at(A,C),at(B,C))) ),
file(unknown,unknown) ).
tff(f_906,axiom,
! [A,B] :
( ~ once(at_the_same_time(A,B))
| once(A) ),
file(unknown,unknown) ).
tff(f_911,axiom,
! [A,B] :
( ~ once(at_the_same_time(A,B))
| once(B) ),
file(unknown,unknown) ).
tff(c_216,plain,
! [A_302] : ( trajectory_of(A_302) = ax3_sk1(A_302) ),
inference(cnfTransformation,[status(thm)],[f_923]) ).
tff(c_212,plain,
! [B_299,A_298] :
( incident_o(B_299,trajectory_of(A_298))
| ~ once(at(A_298,B_299)) ),
inference(cnfTransformation,[status(thm)],[f_916]) ).
tff(c_1845,plain,
! [B_639,A_640] :
( incident_o(B_639,ax3_sk1(A_640))
| ~ once(at(A_640,B_639)) ),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_212]) ).
tff(c_420,plain,
! [B_381,A_382] :
( incident_o(B_381,ax3_sk1(A_382))
| ~ once(at(A_382,B_381)) ),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_212]) ).
tff(c_224,plain,
( ~ incident_o(sk27,trajectory_of(sk29))
| ~ incident_o(sk27,trajectory_of(sk28)) ),
inference(cnfTransformation,[status(thm)],[f_948]) ).
tff(c_225,plain,
( ~ incident_o(sk27,ax3_sk1(sk29))
| ~ incident_o(sk27,ax3_sk1(sk28)) ),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_216,c_224]) ).
tff(c_384,plain,
~ incident_o(sk27,ax3_sk1(sk28)),
inference(splitLeft,[status(thm)],[c_225]) ).
tff(c_428,plain,
~ once(at(sk28,sk27)),
inference(resolution,[status(thm)],[c_420,c_384]) ).
tff(c_222,plain,
connect(sk28,sk29,sk27),
inference(cnfTransformation,[status(thm)],[f_943]) ).
tff(c_1774,plain,
! [A_631,C_632,B_633] :
( once(at_the_same_time(at(A_631,C_632),at(B_633,C_632)))
| ~ connect(A_631,B_633,C_632) ),
inference(cnfTransformation,[status(thm)],[f_871]) ).
tff(c_208,plain,
! [A_294,B_295] :
( once(A_294)
| ~ once(at_the_same_time(A_294,B_295)) ),
inference(cnfTransformation,[status(thm)],[f_906]) ).
tff(c_1793,plain,
! [A_634,C_635,B_636] :
( once(at(A_634,C_635))
| ~ connect(A_634,B_636,C_635) ),
inference(resolution,[status(thm)],[c_1774,c_208]) ).
tff(c_1807,plain,
once(at(sk28,sk27)),
inference(resolution,[status(thm)],[c_222,c_1793]) ).
tff(c_1822,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_428,c_1807]) ).
tff(c_1823,plain,
~ incident_o(sk27,ax3_sk1(sk29)),
inference(splitRight,[status(thm)],[c_225]) ).
tff(c_1849,plain,
~ once(at(sk29,sk27)),
inference(resolution,[status(thm)],[c_1845,c_1823]) ).
tff(c_2758,plain,
! [A_805,C_806,B_807] :
( once(at_the_same_time(at(A_805,C_806),at(B_807,C_806)))
| ~ connect(A_805,B_807,C_806) ),
inference(cnfTransformation,[status(thm)],[f_871]) ).
tff(c_210,plain,
! [B_297,A_296] :
( once(B_297)
| ~ once(at_the_same_time(A_296,B_297)) ),
inference(cnfTransformation,[status(thm)],[f_911]) ).
tff(c_2775,plain,
! [B_811,C_812,A_813] :
( once(at(B_811,C_812))
| ~ connect(A_813,B_811,C_812) ),
inference(resolution,[status(thm)],[c_2758,c_210]) ).
tff(c_2777,plain,
once(at(sk29,sk27)),
inference(resolution,[status(thm)],[c_222,c_2775]) ).
tff(c_2781,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1849,c_2777]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GEO147-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/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.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri Aug 4 00:20:54 EDT 2023
% 0.14/0.36 % CPUTime :
% 6.86/2.77 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.86/2.78
% 6.86/2.78 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.86/2.81
% 6.86/2.81 Inference rules
% 6.86/2.81 ----------------------
% 6.86/2.81 #Ref : 0
% 6.86/2.81 #Sup : 532
% 6.86/2.81 #Fact : 4
% 6.86/2.81 #Define : 0
% 6.86/2.81 #Split : 2
% 6.86/2.81 #Chain : 0
% 6.86/2.81 #Close : 0
% 6.86/2.81
% 6.86/2.81 Ordering : KBO
% 6.86/2.81
% 6.86/2.81 Simplification rules
% 6.86/2.81 ----------------------
% 6.86/2.81 #Subsume : 88
% 6.86/2.81 #Demod : 29
% 6.86/2.81 #Tautology : 82
% 6.86/2.81 #SimpNegUnit : 3
% 6.86/2.81 #BackRed : 0
% 6.86/2.81
% 6.86/2.81 #Partial instantiations: 0
% 6.86/2.81 #Strategies tried : 1
% 6.86/2.81
% 6.86/2.81 Timing (in seconds)
% 6.86/2.81 ----------------------
% 6.86/2.81 Preprocessing : 0.74
% 6.86/2.81 Parsing : 0.40
% 6.86/2.81 CNF conversion : 0.06
% 6.86/2.81 Main loop : 0.91
% 6.86/2.81 Inferencing : 0.36
% 6.86/2.81 Reduction : 0.24
% 6.86/2.81 Demodulation : 0.16
% 6.86/2.81 BG Simplification : 0.05
% 6.86/2.81 Subsumption : 0.19
% 6.86/2.81 Abstraction : 0.03
% 6.86/2.81 MUC search : 0.00
% 6.86/2.81 Cooper : 0.00
% 6.86/2.81 Total : 1.70
% 6.86/2.81 Index Insertion : 0.00
% 6.86/2.81 Index Deletion : 0.00
% 6.86/2.81 Index Matching : 0.00
% 6.86/2.81 BG Taut test : 0.00
%------------------------------------------------------------------------------