TSTP Solution File: GEO117+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO117+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 : n028.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:13 EDT 2023
% Result : Theorem 16.13s 5.46s
% Output : CNFRefutation 16.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 51
% Syntax : Number of formulae : 59 ( 6 unt; 47 typ; 0 def)
% Number of atoms : 28 ( 1 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 27 ( 11 ~; 5 |; 7 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 102 ( 45 >; 57 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-4 aty)
% Number of functors : 34 ( 34 usr; 2 con; 0-5 aty)
% Number of variables : 34 (; 32 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ between_o > between_c > ordered_by > meet > start_point > part_of > inner_point > incident_o > incident_c > finish_point > end_point > open > closed > sum > #nlpp > underlying_curve > #skF_9 > #skF_7 > #skF_24 > #skF_11 > #skF_26 > #skF_6 > #skF_30 > #skF_31 > #skF_19 > #skF_17 > #skF_20 > #skF_8 > #skF_13 > #skF_14 > #skF_12 > #skF_18 > #skF_16 > #skF_10 > #skF_2 > #skF_32 > #skF_23 > #skF_28 > #skF_25 > #skF_3 > #skF_29 > #skF_27 > #skF_1 > #skF_5 > #skF_22 > #skF_15 > #skF_4 > #skF_21
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff(underlying_curve,type,
underlying_curve: $i > $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(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_31',type,
'#skF_31': $i ).
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_20',type,
'#skF_20': ( $i * $i * $i * $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i > $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(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(sum,type,
sum: ( $i * $i ) > $i ).
tff(ordered_by,type,
ordered_by: ( $i * $i * $i ) > $o ).
tff('#skF_32',type,
'#skF_32': $i ).
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_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(open,type,
open: $i > $o ).
tff('#skF_21',type,
'#skF_21': ( $i * $i * $i * $i * $i ) > $i ).
tff(f_366,negated_conjecture,
~ ! [O,P] : ~ ordered_by(O,P,P),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_4_4) ).
tff(f_278,axiom,
! [O,P,Q,R] :
( between_o(O,P,Q,R)
<=> ( ( ordered_by(O,P,Q)
& ordered_by(O,Q,R) )
| ( ordered_by(O,R,Q)
& ordered_by(O,Q,P) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',between_o_defn) ).
tff(f_326,axiom,
! [P,Q,R,O] :
( between_o(O,P,Q,R)
<=> ? [C] :
( ! [P] :
( incident_o(P,O)
<=> incident_c(P,C) )
& between_c(C,P,Q,R) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',o3) ).
tff(f_242,axiom,
! [C,P,Q,R] :
( between_c(C,P,Q,R)
<=> ( ( P != R )
& ? [Cpp] :
( part_of(Cpp,C)
& end_point(P,Cpp)
& end_point(R,Cpp)
& inner_point(Q,Cpp) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+1.ax',between_c_defn) ).
tff(c_194,plain,
ordered_by('#skF_31','#skF_32','#skF_32'),
inference(cnfTransformation,[status(thm)],[f_366]) ).
tff(c_118,plain,
! [O_78,Q_80,P_79,R_81] :
( ~ ordered_by(O_78,Q_80,P_79)
| ~ ordered_by(O_78,R_81,Q_80)
| between_o(O_78,P_79,Q_80,R_81) ),
inference(cnfTransformation,[status(thm)],[f_278]) ).
tff(c_70824,plain,
! [P_49581,Q_49582,R_49583,O_49584] :
( between_c('#skF_22'(P_49581,Q_49582,R_49583,O_49584),P_49581,Q_49582,R_49583)
| ~ between_o(O_49584,P_49581,Q_49582,R_49583) ),
inference(cnfTransformation,[status(thm)],[f_326]) ).
tff(c_108,plain,
! [C_71,R_74,Q_73] : ~ between_c(C_71,R_74,Q_73,R_74),
inference(cnfTransformation,[status(thm)],[f_242]) ).
tff(c_71163,plain,
! [O_49801,R_49802,Q_49803] : ~ between_o(O_49801,R_49802,Q_49803,R_49802),
inference(resolution,[status(thm)],[c_70824,c_108]) ).
tff(c_71174,plain,
! [O_50020,Q_50021,R_50022] :
( ~ ordered_by(O_50020,Q_50021,R_50022)
| ~ ordered_by(O_50020,R_50022,Q_50021) ),
inference(resolution,[status(thm)],[c_118,c_71163]) ).
tff(c_71180,plain,
~ ordered_by('#skF_31','#skF_32','#skF_32'),
inference(resolution,[status(thm)],[c_194,c_71174]) ).
tff(c_71186,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_194,c_71180]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO117+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.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 4 00:58:24 EDT 2023
% 0.14/0.35 % CPUTime :
% 16.13/5.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.13/5.46
% 16.13/5.46 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 16.37/5.49
% 16.37/5.49 Inference rules
% 16.37/5.49 ----------------------
% 16.37/5.49 #Ref : 0
% 16.37/5.49 #Sup : 12703
% 16.37/5.49 #Fact : 4
% 16.37/5.49 #Define : 0
% 16.37/5.49 #Split : 1
% 16.37/5.49 #Chain : 0
% 16.37/5.49 #Close : 0
% 16.37/5.49
% 16.37/5.49 Ordering : KBO
% 16.37/5.49
% 16.37/5.49 Simplification rules
% 16.37/5.49 ----------------------
% 16.37/5.49 #Subsume : 5729
% 16.37/5.49 #Demod : 2184
% 16.37/5.49 #Tautology : 1470
% 16.37/5.49 #SimpNegUnit : 2
% 16.37/5.49 #BackRed : 0
% 16.37/5.49
% 16.37/5.49 #Partial instantiations: 23358
% 16.37/5.49 #Strategies tried : 1
% 16.37/5.49
% 16.37/5.49 Timing (in seconds)
% 16.37/5.49 ----------------------
% 16.37/5.49 Preprocessing : 0.64
% 16.37/5.49 Parsing : 0.31
% 16.37/5.49 CNF conversion : 0.06
% 16.37/5.49 Main loop : 3.78
% 16.37/5.49 Inferencing : 1.56
% 16.37/5.49 Reduction : 0.93
% 16.37/5.49 Demodulation : 0.65
% 16.37/5.49 BG Simplification : 0.10
% 16.37/5.49 Subsumption : 1.04
% 16.37/5.49 Abstraction : 0.13
% 16.37/5.49 MUC search : 0.00
% 16.37/5.49 Cooper : 0.00
% 16.37/5.49 Total : 4.47
% 16.37/5.49 Index Insertion : 0.00
% 16.37/5.49 Index Deletion : 0.00
% 16.37/5.49 Index Matching : 0.00
% 16.37/5.49 BG Taut test : 0.00
%------------------------------------------------------------------------------