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 : 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 : Theorem 48.48s 32.26s
% Output : CNFRefutation 48.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 62
% Syntax : Number of formulae : 81 ( 12 unt; 57 typ; 0 def)
% Number of atoms : 45 ( 2 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 43 ( 22 ~; 13 |; 3 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 114 ( 52 >; 62 *; 0 +; 0 <<)
% Number of predicates : 17 ( 15 usr; 1 prp; 0-4 aty)
% Number of functors : 42 ( 42 usr; 5 con; 0-5 aty)
% Number of variables : 44 (; 43 !; 1 ?; 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 > sum > at_the_same_time > at > #nlpp > underlying_curve > trajectory_of > #skF_9 > #skF_33 > #skF_7 > #skF_24 > #skF_11 > #skF_26 > #skF_6 > #skF_30 > #skF_19 > #skF_17 > #skF_31 > #skF_32 > #skF_36 > #skF_20 > #skF_8 > #skF_37 > #skF_13 > #skF_14 > #skF_12 > #skF_18 > #skF_16 > #skF_10 > #skF_2 > #skF_23 > #skF_28 > #skF_25 > #skF_3 > #skF_35 > #skF_29 > #skF_27 > #skF_1 > #skF_5 > #skF_22 > #skF_15 > #skF_4 > #skF_34 > #skF_21
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(once,type,
once: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff(underlying_curve,type,
underlying_curve: $i > $i ).
tff('#skF_33',type,
'#skF_33': $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_24',type,
'#skF_24': ( $i * $i * $i ) > $i ).
tff(between_c,type,
between_c: ( $i * $i * $i * $i ) > $o ).
tff(closed,type,
closed: $i > $o ).
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff(inner_point,type,
inner_point: ( $i * $i ) > $o ).
tff(trajectory_of,type,
trajectory_of: $i > $i ).
tff(end_point,type,
end_point: ( $i * $i ) > $o ).
tff('#skF_26',type,
'#skF_26': ( $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_30',type,
'#skF_30': ( $i * $i ) > $i ).
tff(finish_point,type,
finish_point: ( $i * $i ) > $o ).
tff('#skF_19',type,
'#skF_19': $i > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i ) > $i ).
tff(start_point,type,
start_point: ( $i * $i ) > $o ).
tff('#skF_31',type,
'#skF_31': $i > $i ).
tff('#skF_32',type,
'#skF_32': ( $i * $i ) > $i ).
tff('#skF_36',type,
'#skF_36': $i ).
tff(at_the_same_time,type,
at_the_same_time: ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i * $i * $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i > $i ).
tff('#skF_37',type,
'#skF_37': $i ).
tff(part_of,type,
part_of: ( $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': ( $i * $i ) > $i ).
tff(between_o,type,
between_o: ( $i * $i * $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(meet,type,
meet: ( $i * $i * $i ) > $o ).
tff('#skF_18',type,
'#skF_18': ( $i * $i ) > $i ).
tff(at,type,
at: ( $i * $i ) > $i ).
tff(incident_c,type,
incident_c: ( $i * $i ) > $o ).
tff('#skF_16',type,
'#skF_16': ( $i * $i * $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(connect,type,
connect: ( $i * $i * $i ) > $o ).
tff(sum,type,
sum: ( $i * $i ) > $i ).
tff(ordered_by,type,
ordered_by: ( $i * $i * $i ) > $o ).
tff('#skF_23',type,
'#skF_23': $i > $i ).
tff('#skF_28',type,
'#skF_28': ( $i * $i ) > $i ).
tff(incident_o,type,
incident_o: ( $i * $i ) > $o ).
tff('#skF_25',type,
'#skF_25': ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_35',type,
'#skF_35': $i ).
tff('#skF_29',type,
'#skF_29': ( $i * $i ) > $i ).
tff('#skF_27',type,
'#skF_27': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_22',type,
'#skF_22': ( $i * $i * $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_34',type,
'#skF_34': $i ).
tff(open,type,
open: $i > $o ).
tff('#skF_21',type,
'#skF_21': ( $i * $i * $i * $i * $i ) > $i ).
tff(f_445,negated_conjecture,
~ ! [P,X,Y] :
( connect(X,Y,P)
=> ! [Q1,Q2] :
( ( ordered_by(trajectory_of(Y),Q2,P)
& ordered_by(trajectory_of(X),P,Q1) )
=> ~ once(at_the_same_time(at(X,Q1),at(Y,Q2))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14) ).
tff(f_392,axiom,
! [X,Y,P] :
( connect(X,Y,P)
<=> once(at_the_same_time(at(X,P),at(Y,P))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+3.ax',connect_defn) ).
tff(f_396,axiom,
! [A,B] :
( once(at_the_same_time(A,B))
<=> once(at_the_same_time(B,A)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+3.ax',symmetry_of_at_the_same_time) ).
tff(f_417,axiom,
! [X] :
? [O] : ( trajectory_of(X) = O ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+3.ax',trajectories_are_oriented_curves) ).
tff(f_426,axiom,
! [P1,P2,Q1,Q2,X,Y] :
( ( once(at_the_same_time(at(X,P1),at(Y,P2)))
& once(at_the_same_time(at(X,Q1),at(Y,Q2))) )
=> ~ ( ordered_by(trajectory_of(X),P1,Q1)
& ordered_by(trajectory_of(Y),Q2,P2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+3.ax',homogeneous_behaviour) ).
tff(c_228,plain,
connect('#skF_34','#skF_35','#skF_33'),
inference(cnfTransformation,[status(thm)],[f_445]) ).
tff(c_1595,plain,
! [X_455,P_456,Y_457] :
( once(at_the_same_time(at(X_455,P_456),at(Y_457,P_456)))
| ~ connect(X_455,Y_457,P_456) ),
inference(cnfTransformation,[status(thm)],[f_392]) ).
tff(c_200,plain,
! [A_137,B_138] :
( once(at_the_same_time(A_137,B_138))
| ~ once(at_the_same_time(B_138,A_137)) ),
inference(cnfTransformation,[status(thm)],[f_396]) ).
tff(c_1608,plain,
! [Y_457,P_456,X_455] :
( once(at_the_same_time(at(Y_457,P_456),at(X_455,P_456)))
| ~ connect(X_455,Y_457,P_456) ),
inference(resolution,[status(thm)],[c_1595,c_200]) ).
tff(c_222,plain,
once(at_the_same_time(at('#skF_34','#skF_36'),at('#skF_35','#skF_37'))),
inference(cnfTransformation,[status(thm)],[f_445]) ).
tff(c_483,plain,
! [A_239,B_240] :
( once(at_the_same_time(A_239,B_240))
| ~ once(at_the_same_time(B_240,A_239)) ),
inference(cnfTransformation,[status(thm)],[f_396]) ).
tff(c_489,plain,
once(at_the_same_time(at('#skF_35','#skF_37'),at('#skF_34','#skF_36'))),
inference(resolution,[status(thm)],[c_222,c_483]) ).
tff(c_216,plain,
! [X_147] : ( trajectory_of(X_147) = '#skF_31'(X_147) ),
inference(cnfTransformation,[status(thm)],[f_417]) ).
tff(c_226,plain,
ordered_by(trajectory_of('#skF_35'),'#skF_37','#skF_33'),
inference(cnfTransformation,[status(thm)],[f_445]) ).
tff(c_229,plain,
ordered_by('#skF_31'('#skF_35'),'#skF_37','#skF_33'),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_226]) ).
tff(c_224,plain,
ordered_by(trajectory_of('#skF_34'),'#skF_33','#skF_36'),
inference(cnfTransformation,[status(thm)],[f_445]) ).
tff(c_230,plain,
ordered_by('#skF_31'('#skF_34'),'#skF_33','#skF_36'),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_224]) ).
tff(c_218,plain,
! [Q2_152,P1_149,Q1_151,P2_150,X_153,Y_154] :
( ~ ordered_by(trajectory_of(Y_154),Q2_152,P2_150)
| ~ ordered_by(trajectory_of(X_153),P1_149,Q1_151)
| ~ once(at_the_same_time(at(X_153,Q1_151),at(Y_154,Q2_152)))
| ~ once(at_the_same_time(at(X_153,P1_149),at(Y_154,P2_150))) ),
inference(cnfTransformation,[status(thm)],[f_426]) ).
tff(c_194707,plain,
! [X_141733,Q2_141737,P2_141732,Y_141735,P1_141736,Q1_141734] :
( ~ ordered_by('#skF_31'(Y_141735),Q2_141737,P2_141732)
| ~ ordered_by('#skF_31'(X_141733),P1_141736,Q1_141734)
| ~ once(at_the_same_time(at(X_141733,Q1_141734),at(Y_141735,Q2_141737)))
| ~ once(at_the_same_time(at(X_141733,P1_141736),at(Y_141735,P2_141732))) ),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_216,c_218]) ).
tff(c_455636,plain,
! [X_427144,P1_427145,Q1_427146] :
( ~ ordered_by('#skF_31'(X_427144),P1_427145,Q1_427146)
| ~ once(at_the_same_time(at(X_427144,Q1_427146),at('#skF_34','#skF_33')))
| ~ once(at_the_same_time(at(X_427144,P1_427145),at('#skF_34','#skF_36'))) ),
inference(resolution,[status(thm)],[c_230,c_194707]) ).
tff(c_455667,plain,
( ~ once(at_the_same_time(at('#skF_35','#skF_33'),at('#skF_34','#skF_33')))
| ~ once(at_the_same_time(at('#skF_35','#skF_37'),at('#skF_34','#skF_36'))) ),
inference(resolution,[status(thm)],[c_229,c_455636]) ).
tff(c_455680,plain,
~ once(at_the_same_time(at('#skF_35','#skF_33'),at('#skF_34','#skF_33'))),
inference(demodulation,[status(thm),theory(equality)],[c_489,c_455667]) ).
tff(c_455683,plain,
~ connect('#skF_34','#skF_35','#skF_33'),
inference(resolution,[status(thm)],[c_1608,c_455680]) ).
tff(c_455690,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_228,c_455683]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GEO148+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 : 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:36 EDT 2023
% 0.14/0.36 % CPUTime :
% 48.48/32.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 48.48/32.27
% 48.48/32.27 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 48.48/32.30
% 48.48/32.30 Inference rules
% 48.48/32.30 ----------------------
% 48.48/32.30 #Ref : 0
% 48.48/32.30 #Sup : 82065
% 48.48/32.30 #Fact : 24
% 48.48/32.30 #Define : 0
% 48.48/32.30 #Split : 25
% 48.48/32.30 #Chain : 0
% 48.48/32.30 #Close : 0
% 48.48/32.30
% 48.48/32.30 Ordering : KBO
% 48.48/32.30
% 48.48/32.30 Simplification rules
% 48.48/32.30 ----------------------
% 48.48/32.30 #Subsume : 44687
% 48.48/32.30 #Demod : 12153
% 48.48/32.30 #Tautology : 6106
% 48.48/32.30 #SimpNegUnit : 24
% 48.48/32.30 #BackRed : 19
% 48.48/32.30
% 48.48/32.30 #Partial instantiations: 222768
% 48.48/32.30 #Strategies tried : 1
% 48.48/32.30
% 48.48/32.30 Timing (in seconds)
% 48.48/32.30 ----------------------
% 48.48/32.31 Preprocessing : 0.69
% 48.48/32.31 Parsing : 0.32
% 48.48/32.31 CNF conversion : 0.07
% 48.48/32.31 Main loop : 30.52
% 48.48/32.31 Inferencing : 5.66
% 48.48/32.31 Reduction : 9.82
% 48.48/32.31 Demodulation : 7.14
% 48.48/32.31 BG Simplification : 0.26
% 48.48/32.31 Subsumption : 10.86
% 48.48/32.31 Abstraction : 0.38
% 48.48/32.31 MUC search : 0.00
% 48.48/32.31 Cooper : 0.00
% 48.48/32.31 Total : 31.26
% 48.48/32.31 Index Insertion : 0.00
% 48.48/32.31 Index Deletion : 0.00
% 48.48/32.31 Index Matching : 0.00
% 48.48/32.31 BG Taut test : 0.00
%------------------------------------------------------------------------------