TSTP Solution File: GEO148-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO148-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 : 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 10:38:17 EDT 2023
% Result : Unsatisfiable 80.83s 57.99s
% Output : CNFRefutation 80.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 60
% Syntax : Number of formulae : 81 ( 16 unt; 51 typ; 0 def)
% Number of atoms : 51 ( 2 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 49 ( 28 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 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 : 36 ( 36 usr; 5 con; 0-5 aty)
% Number of variables : 48 (; 48 !; 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 > sk31 > sk30 > 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(sk30,type,
sk30: $i ).
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(sk31,type,
sk31: $i ).
tff(open,type,
open: $i > $o ).
tff(f_945,axiom,
connect(sk28,sk29,sk27),
file(unknown,unknown) ).
tff(f_873,axiom,
! [A,B,C] :
( ~ connect(A,B,C)
| once(at_the_same_time(at(A,C),at(B,C))) ),
file(unknown,unknown) ).
tff(f_888,axiom,
! [A,B] :
( ~ once(at_the_same_time(A,B))
| once(at_the_same_time(B,A)) ),
file(unknown,unknown) ).
tff(f_878,axiom,
! [A,B,C] :
( ~ once(at_the_same_time(at(A,B),at(C,B)))
| connect(A,C,B) ),
file(unknown,unknown) ).
tff(f_948,axiom,
once(at_the_same_time(at(sk28,sk30),at(sk29,sk31))),
file(unknown,unknown) ).
tff(f_925,axiom,
! [A] : ( trajectory_of(A) = ax3_sk1(A) ),
file(unknown,unknown) ).
tff(f_947,axiom,
ordered_by(trajectory_of(sk28),sk27,sk30),
file(unknown,unknown) ).
tff(f_946,axiom,
ordered_by(trajectory_of(sk29),sk31,sk27),
file(unknown,unknown) ).
tff(f_937,axiom,
! [A,F,B,C,E,D] :
( ~ once(at_the_same_time(at(A,B),at(C,D)))
| ~ once(at_the_same_time(at(A,E),at(C,F)))
| ~ ordered_by(trajectory_of(A),B,E)
| ~ ordered_by(trajectory_of(C),F,D) ),
file(unknown,unknown) ).
tff(c_222,plain,
connect(sk28,sk29,sk27),
inference(cnfTransformation,[status(thm)],[f_945]) ).
tff(c_1427,plain,
! [A_577,C_578,B_579] :
( once(at_the_same_time(at(A_577,C_578),at(B_579,C_578)))
| ~ connect(A_577,B_579,C_578) ),
inference(cnfTransformation,[status(thm)],[f_873]) ).
tff(c_200,plain,
! [B_286,A_285] :
( once(at_the_same_time(B_286,A_285))
| ~ once(at_the_same_time(A_285,B_286)) ),
inference(cnfTransformation,[status(thm)],[f_888]) ).
tff(c_126256,plain,
! [B_92338,C_92339,A_92340] :
( once(at_the_same_time(at(B_92338,C_92339),at(A_92340,C_92339)))
| ~ connect(A_92340,B_92338,C_92339) ),
inference(resolution,[status(thm)],[c_1427,c_200]) ).
tff(c_196,plain,
! [A_280,C_282,B_281] :
( connect(A_280,C_282,B_281)
| ~ once(at_the_same_time(at(A_280,B_281),at(C_282,B_281))) ),
inference(cnfTransformation,[status(thm)],[f_878]) ).
tff(c_127298,plain,
! [B_92597,A_92598,C_92599] :
( connect(B_92597,A_92598,C_92599)
| ~ connect(A_92598,B_92597,C_92599) ),
inference(resolution,[status(thm)],[c_126256,c_196]) ).
tff(c_127352,plain,
connect(sk29,sk28,sk27),
inference(resolution,[status(thm)],[c_222,c_127298]) ).
tff(c_1440,plain,
! [B_579,C_578,A_577] :
( once(at_the_same_time(at(B_579,C_578),at(A_577,C_578)))
| ~ connect(A_577,B_579,C_578) ),
inference(resolution,[status(thm)],[c_1427,c_200]) ).
tff(c_228,plain,
once(at_the_same_time(at(sk28,sk30),at(sk29,sk31))),
inference(cnfTransformation,[status(thm)],[f_948]) ).
tff(c_216,plain,
! [A_302] : ( trajectory_of(A_302) = ax3_sk1(A_302) ),
inference(cnfTransformation,[status(thm)],[f_925]) ).
tff(c_226,plain,
ordered_by(trajectory_of(sk28),sk27,sk30),
inference(cnfTransformation,[status(thm)],[f_947]) ).
tff(c_229,plain,
ordered_by(ax3_sk1(sk28),sk27,sk30),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_226]) ).
tff(c_224,plain,
ordered_by(trajectory_of(sk29),sk31,sk27),
inference(cnfTransformation,[status(thm)],[f_946]) ).
tff(c_230,plain,
ordered_by(ax3_sk1(sk29),sk31,sk27),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_224]) ).
tff(c_218,plain,
! [A_303,F_304,D_308,C_306,B_305,E_307] :
( ~ ordered_by(trajectory_of(C_306),F_304,D_308)
| ~ ordered_by(trajectory_of(A_303),B_305,E_307)
| ~ once(at_the_same_time(at(A_303,E_307),at(C_306,F_304)))
| ~ once(at_the_same_time(at(A_303,B_305),at(C_306,D_308))) ),
inference(cnfTransformation,[status(thm)],[f_937]) ).
tff(c_5773,plain,
! [B_1011,F_1012,E_1013,C_1014,D_1010,A_1009] :
( ~ ordered_by(ax3_sk1(C_1014),F_1012,D_1010)
| ~ ordered_by(ax3_sk1(A_1009),B_1011,E_1013)
| ~ once(at_the_same_time(at(A_1009,E_1013),at(C_1014,F_1012)))
| ~ once(at_the_same_time(at(A_1009,B_1011),at(C_1014,D_1010))) ),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_216,c_218]) ).
tff(c_849963,plain,
! [A_553098,B_553099,E_553100] :
( ~ ordered_by(ax3_sk1(A_553098),B_553099,E_553100)
| ~ once(at_the_same_time(at(A_553098,E_553100),at(sk29,sk31)))
| ~ once(at_the_same_time(at(A_553098,B_553099),at(sk29,sk27))) ),
inference(resolution,[status(thm)],[c_230,c_5773]) ).
tff(c_850013,plain,
( ~ once(at_the_same_time(at(sk28,sk30),at(sk29,sk31)))
| ~ once(at_the_same_time(at(sk28,sk27),at(sk29,sk27))) ),
inference(resolution,[status(thm)],[c_229,c_849963]) ).
tff(c_850026,plain,
~ once(at_the_same_time(at(sk28,sk27),at(sk29,sk27))),
inference(demodulation,[status(thm),theory(equality)],[c_228,c_850013]) ).
tff(c_850048,plain,
~ connect(sk29,sk28,sk27),
inference(resolution,[status(thm)],[c_1440,c_850026]) ).
tff(c_850073,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_127352,c_850048]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO148-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % 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.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 : Fri Aug 4 00:36:09 EDT 2023
% 0.13/0.34 % CPUTime :
% 80.83/57.99 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 80.83/58.00
% 80.83/58.00 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 80.83/58.03
% 80.83/58.03 Inference rules
% 80.83/58.03 ----------------------
% 80.83/58.03 #Ref : 0
% 80.83/58.03 #Sup : 151836
% 80.83/58.03 #Fact : 56
% 80.83/58.03 #Define : 0
% 80.83/58.03 #Split : 23
% 80.83/58.03 #Chain : 0
% 80.83/58.03 #Close : 0
% 80.83/58.03
% 80.83/58.03 Ordering : KBO
% 80.83/58.03
% 80.83/58.03 Simplification rules
% 80.83/58.03 ----------------------
% 80.83/58.03 #Subsume : 92415
% 80.83/58.03 #Demod : 26634
% 80.83/58.03 #Tautology : 10681
% 80.83/58.03 #SimpNegUnit : 11
% 80.83/58.03 #BackRed : 89
% 80.83/58.03
% 80.83/58.03 #Partial instantiations: 310320
% 80.83/58.03 #Strategies tried : 1
% 80.83/58.03
% 80.83/58.03 Timing (in seconds)
% 80.83/58.03 ----------------------
% 80.83/58.03 Preprocessing : 0.78
% 80.83/58.03 Parsing : 0.42
% 80.83/58.03 CNF conversion : 0.06
% 80.83/58.03 Main loop : 56.14
% 80.83/58.03 Inferencing : 8.73
% 80.83/58.03 Reduction : 17.33
% 80.83/58.03 Demodulation : 12.28
% 80.83/58.03 BG Simplification : 0.44
% 80.83/58.03 Subsumption : 27.11
% 80.83/58.03 Abstraction : 0.74
% 80.83/58.03 MUC search : 0.00
% 80.83/58.03 Cooper : 0.00
% 80.83/58.03 Total : 56.97
% 80.83/58.03 Index Insertion : 0.00
% 80.83/58.03 Index Deletion : 0.00
% 80.83/58.03 Index Matching : 0.00
% 80.83/58.03 BG Taut test : 0.00
%------------------------------------------------------------------------------