TSTP Solution File: GEO146-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO146-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 : n018.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 20.96s 8.61s
% Output : CNFRefutation 20.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 54
% Syntax : Number of formulae : 72 ( 8 unt; 49 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 32 ( 17 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 16 ( 15 usr; 1 prp; 0-4 aty)
% Number of functors : 34 ( 34 usr; 3 con; 0-5 aty)
% Number of variables : 31 (; 31 !; 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_945,axiom,
( connect(sk27,sk28,sk29)
| connect(sk28,sk27,sk29) ),
file(unknown,unknown) ).
tff(f_958,axiom,
( ~ connect(sk28,sk27,sk29)
| ~ connect(sk27,sk28,sk29) ),
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_886,axiom,
! [A,B] :
( ~ once(at_the_same_time(A,B))
| once(at_the_same_time(B,A)) ),
file(unknown,unknown) ).
tff(f_876,axiom,
! [A,B,C] :
( ~ once(at_the_same_time(at(A,B),at(C,B)))
| connect(A,C,B) ),
file(unknown,unknown) ).
tff(c_222,plain,
( connect(sk28,sk27,sk29)
| connect(sk27,sk28,sk29) ),
inference(cnfTransformation,[status(thm)],[f_945]) ).
tff(c_355,plain,
connect(sk27,sk28,sk29),
inference(splitLeft,[status(thm)],[c_222]) ).
tff(c_228,plain,
( ~ connect(sk27,sk28,sk29)
| ~ connect(sk28,sk27,sk29) ),
inference(cnfTransformation,[status(thm)],[f_958]) ).
tff(c_399,plain,
~ connect(sk28,sk27,sk29),
inference(demodulation,[status(thm),theory(equality)],[c_355,c_228]) ).
tff(c_1269,plain,
! [A_540,C_541,B_542] :
( once(at_the_same_time(at(A_540,C_541),at(B_542,C_541)))
| ~ connect(A_540,B_542,C_541) ),
inference(cnfTransformation,[status(thm)],[f_871]) ).
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_886]) ).
tff(c_123661,plain,
! [B_70623,C_70624,A_70625] :
( once(at_the_same_time(at(B_70623,C_70624),at(A_70625,C_70624)))
| ~ connect(A_70625,B_70623,C_70624) ),
inference(resolution,[status(thm)],[c_1269,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_876]) ).
tff(c_124670,plain,
! [B_70818,A_70819,C_70820] :
( connect(B_70818,A_70819,C_70820)
| ~ connect(A_70819,B_70818,C_70820) ),
inference(resolution,[status(thm)],[c_123661,c_196]) ).
tff(c_124696,plain,
connect(sk28,sk27,sk29),
inference(resolution,[status(thm)],[c_355,c_124670]) ).
tff(c_124719,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_399,c_124696]) ).
tff(c_124721,plain,
~ connect(sk27,sk28,sk29),
inference(splitRight,[status(thm)],[c_222]) ).
tff(c_124720,plain,
connect(sk28,sk27,sk29),
inference(splitRight,[status(thm)],[c_222]) ).
tff(c_125829,plain,
! [A_71235,C_71236,B_71237] :
( once(at_the_same_time(at(A_71235,C_71236),at(B_71237,C_71236)))
| ~ connect(A_71235,B_71237,C_71236) ),
inference(cnfTransformation,[status(thm)],[f_871]) ).
tff(c_127320,plain,
! [B_71453,C_71454,A_71455] :
( once(at_the_same_time(at(B_71453,C_71454),at(A_71455,C_71454)))
| ~ connect(A_71455,B_71453,C_71454) ),
inference(resolution,[status(thm)],[c_125829,c_200]) ).
tff(c_127342,plain,
! [B_71456,A_71457,C_71458] :
( connect(B_71456,A_71457,C_71458)
| ~ connect(A_71457,B_71456,C_71458) ),
inference(resolution,[status(thm)],[c_127320,c_196]) ).
tff(c_127364,plain,
connect(sk27,sk28,sk29),
inference(resolution,[status(thm)],[c_124720,c_127342]) ).
tff(c_127385,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_124721,c_127364]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GEO146-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.15 % 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 : n018.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:52:21 EDT 2023
% 0.14/0.36 % CPUTime :
% 20.96/8.61 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 20.96/8.62
% 20.96/8.62 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 20.96/8.64
% 20.96/8.64 Inference rules
% 20.96/8.64 ----------------------
% 20.96/8.64 #Ref : 0
% 20.96/8.64 #Sup : 23234
% 20.96/8.64 #Fact : 16
% 20.96/8.64 #Define : 0
% 20.96/8.64 #Split : 1
% 20.96/8.64 #Chain : 0
% 20.96/8.64 #Close : 0
% 20.96/8.64
% 20.96/8.64 Ordering : KBO
% 20.96/8.64
% 20.96/8.64 Simplification rules
% 20.96/8.64 ----------------------
% 20.96/8.64 #Subsume : 7992
% 20.96/8.65 #Demod : 4208
% 20.96/8.65 #Tautology : 2422
% 20.96/8.65 #SimpNegUnit : 6
% 20.96/8.65 #BackRed : 0
% 20.96/8.65
% 20.96/8.65 #Partial instantiations: 37026
% 20.96/8.65 #Strategies tried : 1
% 20.96/8.65
% 20.96/8.65 Timing (in seconds)
% 20.96/8.65 ----------------------
% 20.96/8.65 Preprocessing : 0.72
% 20.96/8.65 Parsing : 0.38
% 20.96/8.65 CNF conversion : 0.06
% 20.96/8.65 Main loop : 6.85
% 20.96/8.65 Inferencing : 1.83
% 20.96/8.65 Reduction : 1.93
% 20.96/8.65 Demodulation : 1.38
% 20.96/8.65 BG Simplification : 0.14
% 20.96/8.65 Subsumption : 2.63
% 20.96/8.65 Abstraction : 0.14
% 20.96/8.65 MUC search : 0.00
% 20.96/8.65 Cooper : 0.00
% 20.96/8.65 Total : 7.62
% 20.96/8.65 Index Insertion : 0.00
% 20.96/8.65 Index Deletion : 0.00
% 20.96/8.65 Index Matching : 0.00
% 20.96/8.65 BG Taut test : 0.00
%------------------------------------------------------------------------------