%------------------------------------------------------------------------------ % File : Beagle---0.9.52 % Problem : COM002_20 : TPTP v9.0.0. Released v8.2.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 : n017.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 : Wed Apr 9 05:50:30 PM UTC 2025 % Result : Satisfiable 3.14s 1.74s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : COM002_20 : TPTP v9.0.0. Released v8.2.0. % 0.11/0.13 % 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.13/0.33 % Computer : n017.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Mon Apr 7 16:09:55 EDT 2025 % 0.13/0.33 % CPUTime : % 3.14/1.74 % 3.14/1.74 % SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.14/1.74 % 3.14/1.74 % SZS output start Saturation for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.14/1.75 %$ 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 % 3.14/1.75 % 3.14/1.75 %Foreground sorts: % 3.14/1.75 tff(label, type, label: $tType ). % 3.14/1.75 tff(state, type, state: $tType ). % 3.14/1.75 tff(statement, type, statement: $tType ). % 3.14/1.75 tff(boolean, type, boolean: $tType ). % 3.14/1.75 tff(register, type, register: $tType ). % 3.14/1.75 tff(number, type, number: $tType ). % 3.14/1.75 % 3.14/1.75 %Background operators: % 3.14/1.75 % 3.14/1.75 % 3.14/1.75 %Foreground operators: % 3.14/1.75 tff(n1, type, n1: number). % 3.14/1.75 tff(out, type, out: label). % 3.14/1.75 tff(register_k, type, register_k: register). % 3.14/1.75 tff(goto, type, goto: label > statement). % 3.14/1.75 tff(fails, type, fails: (state * state) > $o). % 3.14/1.75 tff(equal_function, type, equal_function: (register * number) > boolean). % 3.14/1.75 tff(register_j, type, register_j: register). % 3.14/1.75 tff(n0, type, n0: number). % 3.14/1.75 tff(p8, type, p8: state). % 3.14/1.75 tff(labels, type, labels: (label * state) > $o). % 3.14/1.75 tff(p6, type, p6: state). % 3.14/1.75 tff(p7, type, p7: state). % 3.14/1.75 tff(assign, type, assign: (register * number) > statement). % 3.14/1.75 tff(ifthen, type, ifthen: (boolean * state) > statement). % 3.14/1.75 tff(p2, type, p2: state). % 3.14/1.75 tff(times, type, times: (number * register) > number). % 3.14/1.75 tff(p5, type, p5: state). % 3.14/1.75 tff(n2, type, n2: number). % 3.14/1.75 tff(has, type, has: (state * statement) > $o). % 3.14/1.75 tff(plus, type, plus: (register * number) > number). % 3.14/1.75 tff(n, type, n: number). % 3.14/1.75 tff(p1, type, p1: state). % 3.14/1.75 tff(loop, type, loop: label). % 3.14/1.75 tff(p3, type, p3: state). % 3.14/1.75 tff(follows, type, follows: (state * state) > $o). % 3.14/1.75 tff(p4, type, p4: state). % 3.14/1.75 % 3.14/1.75 %Saturated clause set: % 3.14/1.75 tff(c_76, plain, (~fails(p3, p8))). % 3.14/1.75 tff(c_71, plain, (![Start_state_22:state]: (~has(Start_state_22, goto(loop)) | ~fails(p3, Start_state_22)))). % 3.14/1.75 tff(c_6, plain, (![Label_6:label, Goal_state_8:state, Start_state_7:state]: (~labels(Label_6, Goal_state_8) | ~has(Start_state_7, goto(Label_6)) | ~fails(Goal_state_8, Start_state_7)))). % 3.14/1.75 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)))). % 3.14/1.75 tff(c_66, plain, (~fails(p4, p3))). % 3.14/1.75 tff(c_8, plain, (![Start_state_10:state, Condition_9:boolean, Goal_state_11:state]: (~has(Start_state_10, ifthen(Condition_9, Goal_state_11)) | ~fails(Goal_state_11, Start_state_10)))). % 3.14/1.75 tff(c_28, plain, (has(p6, assign(register_k, times(n2, register_k))))). % 3.14/1.75 tff(c_20, plain, (has(p3, ifthen(equal_function(register_j, n), p4)))). % 3.14/1.75 tff(c_61, plain, (~fails(p8, p7))). % 3.14/1.75 tff(c_58, plain, (~fails(p6, p3))). % 3.14/1.75 tff(c_59, plain, (~fails(p3, p2))). % 3.14/1.75 tff(c_32, plain, (has(p7, assign(register_j, plus(register_j, n1))))). % 3.14/1.75 tff(c_60, plain, (~fails(p7, p6))). % 3.14/1.75 tff(c_57, plain, (~fails(p2, p1))). % 3.14/1.75 tff(c_56, plain, (~fails(p5, p4))). % 3.14/1.75 tff(c_2, plain, (![Goal_state_2:state, Start_state_1:state]: (~follows(Goal_state_2, Start_state_1) | ~fails(Goal_state_2, Start_state_1)))). % 3.14/1.75 tff(c_14, plain, (has(p2, assign(register_k, n1)))). % 3.14/1.75 tff(c_10, plain, (has(p1, assign(register_j, n0)))). % 3.14/1.75 tff(c_36, plain, (has(p8, goto(loop)))). % 3.14/1.75 tff(c_22, plain, (has(p4, goto(out)))). % 3.14/1.75 tff(c_24, plain, (follows(p5, p4))). % 3.14/1.75 tff(c_12, plain, (follows(p2, p1))). % 3.14/1.75 tff(c_26, plain, (follows(p6, p3))). % 3.14/1.75 tff(c_16, plain, (labels(loop, p3))). % 3.14/1.75 tff(c_18, plain, (follows(p3, p2))). % 3.14/1.75 tff(c_30, plain, (follows(p7, p6))). % 3.14/1.75 tff(c_34, plain, (follows(p8, p7))). % 3.14/1.75 % SZS output end Saturation for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.14/1.75 %------------------------------------------------------------------------------