TSTP Solution File: COM002_2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COM002_2 : TPTP v8.1.2. Released v5.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 : n016.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 : Theorem 3.51s 1.83s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 41
% Syntax : Number of formulae : 63 ( 19 unt; 32 typ; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 17 ~; 14 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 7 ( 6 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 : 24 (; 24 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
%$ labels > has > follows > fails > 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:
tff(label,type,
label: $tType ).
tff(state,type,
state: $tType ).
tff(statement,type,
statement: $tType ).
tff(boolean,type,
boolean: $tType ).
tff(register,type,
register: $tType ).
tff(number,type,
number: $tType ).
%Background operators:
%Foreground operators:
tff(n1,type,
n1: number ).
tff(out,type,
out: label ).
tff(register_k,type,
register_k: register ).
tff(goto,type,
goto: label > statement ).
tff(fails,type,
fails: ( state * state ) > $o ).
tff(equal_function,type,
equal_function: ( register * number ) > boolean ).
tff(register_j,type,
register_j: register ).
tff(n0,type,
n0: number ).
tff(p8,type,
p8: state ).
tff(labels,type,
labels: ( label * state ) > $o ).
tff(p6,type,
p6: state ).
tff(p7,type,
p7: state ).
tff(assign,type,
assign: ( register * number ) > statement ).
tff(ifthen,type,
ifthen: ( boolean * state ) > statement ).
tff(p2,type,
p2: state ).
tff(times,type,
times: ( number * register ) > number ).
tff(p5,type,
p5: state ).
tff(n2,type,
n2: number ).
tff(has,type,
has: ( state * statement ) > $o ).
tff(plus,type,
plus: ( register * number ) > number ).
tff(n,type,
n: number ).
tff(p1,type,
p1: state ).
tff(loop,type,
loop: label ).
tff(p3,type,
p3: state ).
tff(follows,type,
follows: ( state * state ) > $o ).
tff(p4,type,
p4: state ).
tff(f_65,hypothesis,
follows(p6,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_3_to_6) ).
tff(f_38,axiom,
! [Start_state: state,Goal_state: state] :
~ ( fails(Goal_state,Start_state)
& follows(Goal_state,Start_state) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',direct_success) ).
tff(f_70,hypothesis,
has(p8,goto(loop)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_8) ).
tff(f_60,hypothesis,
labels(loop,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',label_state_3) ).
tff(f_51,axiom,
! [Label: label,Start_state: state,Goal_state: state] :
~ ( fails(Goal_state,Start_state)
& has(Start_state,goto(Label))
& labels(Label,Goal_state) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goto_success) ).
tff(f_73,negated_conjecture,
~ ~ fails(p3,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
tff(f_44,axiom,
! [Intermediate_state: state,Start_state: state,Goal_state: state] :
( fails(Goal_state,Start_state)
=> ( fails(Goal_state,Intermediate_state)
| fails(Intermediate_state,Start_state) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_success) ).
tff(f_69,hypothesis,
follows(p8,p7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_7_to_8) ).
tff(f_67,hypothesis,
follows(p7,p6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_6_to_7) ).
tff(c_26,plain,
follows(p6,p3),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_39,plain,
! [Goal_state_12: state,Start_state_13: state] :
( ~ follows(Goal_state_12,Start_state_13)
| ~ fails(Goal_state_12,Start_state_13) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_58,plain,
~ fails(p6,p3),
inference(resolution,[status(thm)],[c_26,c_39]) ).
tff(c_36,plain,
has(p8,goto(loop)),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_16,plain,
labels(loop,p3),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_73,plain,
! [Label_20: label,Goal_state_21: state,Start_state_22: state] :
( ~ labels(Label_20,Goal_state_21)
| ~ has(Start_state_22,goto(Label_20))
| ~ fails(Goal_state_21,Start_state_22) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_160,plain,
! [Start_state_26: state] :
( ~ has(Start_state_26,goto(loop))
| ~ fails(p3,Start_state_26) ),
inference(resolution,[status(thm)],[c_16,c_73]) ).
tff(c_164,plain,
~ fails(p3,p8),
inference(resolution,[status(thm)],[c_36,c_160]) ).
tff(c_38,plain,
fails(p3,p3),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_69,plain,
! [Intermediate_state_17: state,Start_state_18: state,Goal_state_19: state] :
( fails(Intermediate_state_17,Start_state_18)
| fails(Goal_state_19,Intermediate_state_17)
| ~ fails(Goal_state_19,Start_state_18) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_93,plain,
! [Intermediate_state_23: state] :
( fails(Intermediate_state_23,p3)
| fails(p3,Intermediate_state_23) ),
inference(resolution,[status(thm)],[c_38,c_69]) ).
tff(c_4,plain,
! [Intermediate_state_3: state,Start_state_4: state,Goal_state_5: state] :
( fails(Intermediate_state_3,Start_state_4)
| fails(Goal_state_5,Intermediate_state_3)
| ~ fails(Goal_state_5,Start_state_4) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_240,plain,
! [Intermediate_state_28: state,Intermediate_state_29: state] :
( fails(Intermediate_state_28,p3)
| fails(Intermediate_state_29,Intermediate_state_28)
| fails(p3,Intermediate_state_29) ),
inference(resolution,[status(thm)],[c_93,c_4]) ).
tff(c_34,plain,
follows(p8,p7),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_60,plain,
~ fails(p8,p7),
inference(resolution,[status(thm)],[c_34,c_39]) ).
tff(c_263,plain,
( fails(p7,p3)
| fails(p3,p8) ),
inference(resolution,[status(thm)],[c_240,c_60]) ).
tff(c_289,plain,
fails(p7,p3),
inference(negUnitSimplification,[status(thm)],[c_164,c_263]) ).
tff(c_300,plain,
! [Intermediate_state_30: state] :
( fails(Intermediate_state_30,p3)
| fails(p7,Intermediate_state_30) ),
inference(resolution,[status(thm)],[c_289,c_4]) ).
tff(c_30,plain,
follows(p7,p6),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_63,plain,
~ fails(p7,p6),
inference(resolution,[status(thm)],[c_30,c_39]) ).
tff(c_309,plain,
fails(p6,p3),
inference(resolution,[status(thm)],[c_300,c_63]) ).
tff(c_315,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_58,c_309]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COM002_2 : TPTP v8.1.2. Released v5.0.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 : n016.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:04:08 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.51/1.83 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.51/1.84
% 3.51/1.84 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.72/1.87
% 3.72/1.87 Inference rules
% 3.72/1.87 ----------------------
% 3.72/1.87 #Ref : 0
% 3.72/1.87 #Sup : 51
% 3.72/1.87 #Fact : 8
% 3.72/1.87 #Define : 0
% 3.72/1.87 #Split : 0
% 3.72/1.87 #Chain : 0
% 3.72/1.87 #Close : 0
% 3.72/1.87
% 3.72/1.87 Ordering : KBO
% 3.72/1.87
% 3.72/1.87 Simplification rules
% 3.72/1.87 ----------------------
% 3.72/1.87 #Subsume : 3
% 3.72/1.87 #Demod : 16
% 3.72/1.87 #Tautology : 14
% 3.72/1.87 #SimpNegUnit : 4
% 3.72/1.87 #BackRed : 0
% 3.72/1.87
% 3.72/1.87 #Partial instantiations: 0
% 3.72/1.87 #Strategies tried : 1
% 3.72/1.87
% 3.72/1.87 Timing (in seconds)
% 3.72/1.87 ----------------------
% 3.75/1.87 Preprocessing : 0.51
% 3.75/1.87 Parsing : 0.31
% 3.75/1.87 CNF conversion : 0.02
% 3.75/1.87 Main loop : 0.35
% 3.75/1.87 Inferencing : 0.16
% 3.75/1.87 Reduction : 0.09
% 3.75/1.87 Demodulation : 0.07
% 3.75/1.87 BG Simplification : 0.01
% 3.75/1.87 Subsumption : 0.06
% 3.75/1.87 Abstraction : 0.01
% 3.75/1.87 MUC search : 0.00
% 3.75/1.87 Cooper : 0.00
% 3.75/1.87 Total : 0.91
% 3.75/1.87 Index Insertion : 0.00
% 3.75/1.87 Index Deletion : 0.00
% 3.75/1.87 Index Matching : 0.00
% 3.75/1.87 BG Taut test : 0.00
%------------------------------------------------------------------------------