TSTP Solution File: COM002-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COM002-1 : TPTP v8.1.2. Released v1.0.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 : n004.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:35:12 EDT 2023
% Result : Unsatisfiable 4.06s 1.98s
% Output : CNFRefutation 4.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 35
% Syntax : Number of formulae : 57 ( 15 unt; 26 typ; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 56 ( 30 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 10 >; 9 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 16 con; 0-2 aty)
% Number of variables : 35 (; 35 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ succeeds > labels > has > follows > times > plus > ifthen > equal_function > assign > #nlpp > goto > register_k > register_j > p8 > p7 > p6 > p5 > p4 > p3 > p2 > p1 > out > n2 > n1 > n0 > n > loop
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(loop,type,
loop: $i ).
tff(times,type,
times: ( $i * $i ) > $i ).
tff(labels,type,
labels: ( $i * $i ) > $o ).
tff(goto,type,
goto: $i > $i ).
tff(equal_function,type,
equal_function: ( $i * $i ) > $i ).
tff(p1,type,
p1: $i ).
tff(register_k,type,
register_k: $i ).
tff(register_j,type,
register_j: $i ).
tff(n1,type,
n1: $i ).
tff(plus,type,
plus: ( $i * $i ) > $i ).
tff(out,type,
out: $i ).
tff(n0,type,
n0: $i ).
tff(p8,type,
p8: $i ).
tff(assign,type,
assign: ( $i * $i ) > $i ).
tff(p5,type,
p5: $i ).
tff(p7,type,
p7: $i ).
tff(n,type,
n: $i ).
tff(has,type,
has: ( $i * $i ) > $o ).
tff(p3,type,
p3: $i ).
tff(p4,type,
p4: $i ).
tff(succeeds,type,
succeeds: ( $i * $i ) > $o ).
tff(ifthen,type,
ifthen: ( $i * $i ) > $i ).
tff(n2,type,
n2: $i ).
tff(p6,type,
p6: $i ).
tff(follows,type,
follows: ( $i * $i ) > $o ).
tff(p2,type,
p2: $i ).
tff(f_67,axiom,
follows(p8,p7),
file(unknown,unknown) ).
tff(f_65,axiom,
follows(p7,p6),
file(unknown,unknown) ).
tff(f_70,axiom,
~ succeeds(p3,p3),
file(unknown,unknown) ).
tff(f_68,axiom,
has(p8,goto(loop)),
file(unknown,unknown) ).
tff(f_58,axiom,
labels(loop,p3),
file(unknown,unknown) ).
tff(f_49,axiom,
! [Goal_state,Start_state,Label] :
( succeeds(Goal_state,Start_state)
| ~ has(Start_state,goto(Label))
| ~ labels(Label,Goal_state) ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [Goal_state,Start_state] :
( succeeds(Goal_state,Start_state)
| ~ follows(Goal_state,Start_state) ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [Goal_state,Start_state,Intermediate_state] :
( succeeds(Goal_state,Start_state)
| ~ succeeds(Goal_state,Intermediate_state)
| ~ succeeds(Intermediate_state,Start_state) ),
file(unknown,unknown) ).
tff(f_63,axiom,
follows(p6,p3),
file(unknown,unknown) ).
tff(c_34,plain,
follows(p8,p7),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_30,plain,
follows(p7,p6),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_38,plain,
~ succeeds(p3,p3),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_36,plain,
has(p8,goto(loop)),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_16,plain,
labels(loop,p3),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_93,plain,
! [Label_26,Goal_state_27,Start_state_28] :
( ~ labels(Label_26,Goal_state_27)
| ~ has(Start_state_28,goto(Label_26))
| succeeds(Goal_state_27,Start_state_28) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_97,plain,
! [Start_state_29] :
( ~ has(Start_state_29,goto(loop))
| succeeds(p3,Start_state_29) ),
inference(resolution,[status(thm)],[c_16,c_93]) ).
tff(c_101,plain,
succeeds(p3,p8),
inference(resolution,[status(thm)],[c_36,c_97]) ).
tff(c_2,plain,
! [Goal_state_1,Start_state_2] :
( ~ follows(Goal_state_1,Start_state_2)
| succeeds(Goal_state_1,Start_state_2) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_49,plain,
! [Intermediate_state_17,Start_state_18,Goal_state_19] :
( ~ succeeds(Intermediate_state_17,Start_state_18)
| ~ succeeds(Goal_state_19,Intermediate_state_17)
| succeeds(Goal_state_19,Start_state_18) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_55,plain,
! [Goal_state_19,Goal_state_1,Start_state_2] :
( ~ succeeds(Goal_state_19,Goal_state_1)
| succeeds(Goal_state_19,Start_state_2)
| ~ follows(Goal_state_1,Start_state_2) ),
inference(resolution,[status(thm)],[c_2,c_49]) ).
tff(c_106,plain,
! [Start_state_2] :
( succeeds(p3,Start_state_2)
| ~ follows(p8,Start_state_2) ),
inference(resolution,[status(thm)],[c_101,c_55]) ).
tff(c_26,plain,
follows(p6,p3),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_70,plain,
! [Goal_state_22,Goal_state_23,Start_state_24] :
( ~ succeeds(Goal_state_22,Goal_state_23)
| succeeds(Goal_state_22,Start_state_24)
| ~ follows(Goal_state_23,Start_state_24) ),
inference(resolution,[status(thm)],[c_2,c_49]) ).
tff(c_133,plain,
! [Goal_state_32,Start_state_33,Start_state_34] :
( succeeds(Goal_state_32,Start_state_33)
| ~ follows(Start_state_34,Start_state_33)
| ~ follows(Goal_state_32,Start_state_34) ),
inference(resolution,[status(thm)],[c_2,c_70]) ).
tff(c_152,plain,
! [Goal_state_35] :
( succeeds(Goal_state_35,p3)
| ~ follows(Goal_state_35,p6) ),
inference(resolution,[status(thm)],[c_26,c_133]) ).
tff(c_4,plain,
! [Intermediate_state_5,Start_state_4,Goal_state_3] :
( ~ succeeds(Intermediate_state_5,Start_state_4)
| ~ succeeds(Goal_state_3,Intermediate_state_5)
| succeeds(Goal_state_3,Start_state_4) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_694,plain,
! [Goal_state_67,Goal_state_68] :
( ~ succeeds(Goal_state_67,Goal_state_68)
| succeeds(Goal_state_67,p3)
| ~ follows(Goal_state_68,p6) ),
inference(resolution,[status(thm)],[c_152,c_4]) ).
tff(c_730,plain,
! [Start_state_2] :
( succeeds(p3,p3)
| ~ follows(Start_state_2,p6)
| ~ follows(p8,Start_state_2) ),
inference(resolution,[status(thm)],[c_106,c_694]) ).
tff(c_801,plain,
! [Start_state_70] :
( ~ follows(Start_state_70,p6)
| ~ follows(p8,Start_state_70) ),
inference(negUnitSimplification,[status(thm)],[c_38,c_730]) ).
tff(c_803,plain,
~ follows(p8,p7),
inference(resolution,[status(thm)],[c_30,c_801]) ).
tff(c_807,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_803]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COM002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % 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.13/0.34 % Computer : n004.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 : Thu Aug 3 23:27:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 4.06/1.98 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.06/1.98
% 4.06/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.06/2.01
% 4.06/2.01 Inference rules
% 4.06/2.01 ----------------------
% 4.06/2.01 #Ref : 0
% 4.06/2.01 #Sup : 210
% 4.06/2.01 #Fact : 0
% 4.06/2.01 #Define : 0
% 4.06/2.01 #Split : 5
% 4.06/2.01 #Chain : 0
% 4.06/2.01 #Close : 0
% 4.06/2.01
% 4.06/2.01 Ordering : KBO
% 4.06/2.01
% 4.06/2.01 Simplification rules
% 4.06/2.01 ----------------------
% 4.06/2.01 #Subsume : 75
% 4.06/2.01 #Demod : 21
% 4.06/2.01 #Tautology : 11
% 4.06/2.01 #SimpNegUnit : 5
% 4.06/2.01 #BackRed : 0
% 4.06/2.01
% 4.06/2.01 #Partial instantiations: 0
% 4.06/2.01 #Strategies tried : 1
% 4.06/2.01
% 4.06/2.01 Timing (in seconds)
% 4.06/2.01 ----------------------
% 4.06/2.02 Preprocessing : 0.44
% 4.06/2.02 Parsing : 0.25
% 4.06/2.02 CNF conversion : 0.02
% 4.06/2.02 Main loop : 0.51
% 4.06/2.02 Inferencing : 0.20
% 4.06/2.02 Reduction : 0.13
% 4.06/2.02 Demodulation : 0.09
% 4.06/2.02 BG Simplification : 0.02
% 4.06/2.02 Subsumption : 0.13
% 4.06/2.02 Abstraction : 0.02
% 4.06/2.02 MUC search : 0.00
% 4.06/2.02 Cooper : 0.00
% 4.06/2.02 Total : 1.01
% 4.06/2.02 Index Insertion : 0.00
% 4.06/2.02 Index Deletion : 0.00
% 4.06/2.02 Index Matching : 0.00
% 4.06/2.02 BG Taut test : 0.00
%------------------------------------------------------------------------------