%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SWW679_1 : TPTP v9.0.0. Released v6.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 : n022.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 09:53:11 PM UTC 2025
% Result : Theorem 3.45s 1.83s
% Output : CNFRefutation 3.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWW679_1 : TPTP v9.0.0. Released v6.4.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.34 % Computer : n022.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 : Wed Apr 9 06:22:51 EDT 2025
% 0.13/0.34 % CPUTime :
% 3.45/1.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.45/1.84
% 3.45/1.84 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.45/1.84 %$ in > searchtree > node:(Int*Tree*Tree)>Tree > #nlpp > val:(Tree)>Int > right:(Tree)>Tree > left:(Tree)>Tree > empty:Tree > #skF_2 > #skF_1 > #skF_3
% 3.45/1.84
% 3.45/1.84 %Foreground sorts:
% 3.45/1.84 tff(Tree, type, Tree: $tType ).
% 3.45/1.84
% 3.45/1.84 %Background operators:
% 3.45/1.84 tff('#skE_1', type, '#skE_1': $int).
% 3.45/1.84 tff('#skF_4', type, '#skF_4': $int).
% 3.45/1.84
% 3.45/1.84 %Foreground operators:
% 3.45/1.84 tff(val:(Tree)>Int, type, val:(Tree)>Int: Tree > $int).
% 3.45/1.84 tff(right:(Tree)>Tree, type, right:(Tree)>Tree: Tree > Tree).
% 3.45/1.84 tff(node:(Int*Tree*Tree)>Tree, type, node:(Int*Tree*Tree)>Tree: ($int * Tree * Tree) > Tree).
% 3.45/1.84 tff(in, type, in: ($int * Tree) > $o).
% 3.45/1.84 tff(searchtree, type, searchtree: Tree > $o).
% 3.45/1.84 tff('#skF_2', type, '#skF_2': Tree > $int).
% 3.45/1.84 tff('#skF_1', type, '#skF_1': Tree > $int).
% 3.45/1.84 tff('#skF_3', type, '#skF_3': Tree).
% 3.45/1.84 tff(left:(Tree)>Tree, type, left:(Tree)>Tree: Tree > Tree).
% 3.45/1.84 tff(empty:Tree, type, empty:Tree: Tree).
% 3.45/1.84
% 3.45/1.85 tff(f_125, negated_conjecture, ~(![T:Tree, Va:$int]: (searchtree(T) => (((T = empty) => $true) & (~(T = empty) => (((Va = val(T)) => $true) & (~(Va = val(T)) => (($less(Va, val(T)) => (?[T_1:Tree]: ((T_1 = left(T)) & searchtree(T_1)))) & (~$less(Va, val(T)) => (?[T_2:Tree]: ((T_2 = right(T)) & searchtree(T_2))))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', formula_007)).
% 3.45/1.85 tff(f_91, axiom, (![T:Tree]: (searchtree(T) <=> (((T = empty) => $true) & (~(T = empty) => (((searchtree(left(T)) & searchtree(right(T))) & (![Va:$int]: (in(Va, left(T)) => $lesseq(Va, val(T))))) & (![Va:$int]: (in(Va, right(T)) => $greater(Va, val(T))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', formula_006)).
% 3.45/1.85 tff(c_50, plain, (empty!='#skF_3'), inference(cnfTransformation, [status(thm)], [f_125])).
% 3.45/1.85 tff(c_52, plain, (searchtree('#skF_3')), inference(cnfTransformation, [status(thm)], [f_125])).
% 3.45/1.85 tff(c_232, plain, (![T_69:Tree]: (searchtree(left(T_69)) | empty=T_69 | ~searchtree(T_69))), inference(cnfTransformation, [status(thm)], [f_91])).
% 3.45/1.85 tff(c_162, plain, (![T_54:Tree]: (searchtree(right(T_54)) | empty=T_54 | ~searchtree(T_54))), inference(cnfTransformation, [status(thm)], [f_91])).
% 3.45/1.85 tff(c_54, plain, (~searchtree(left('#skF_3')) | ~searchtree(right('#skF_3'))), inference(cnfTransformation, [status(thm)], [f_125])).
% 3.45/1.85 tff(c_116, plain, (~searchtree(right('#skF_3'))), inference(splitLeft, [status(thm)], [c_54])).
% 3.45/1.85 tff(c_165, plain, (empty='#skF_3' | ~searchtree('#skF_3')), inference(resolution, [status(thm)], [c_162, c_116])).
% 3.45/1.85 tff(c_171, plain, (empty='#skF_3'), inference(demodulation, [status(thm), theory('equality')], [c_52, c_165])).
% 3.45/1.85 tff(c_173, plain, $false, inference(negUnitSimplification, [status(thm)], [c_50, c_171])).
% 3.45/1.85 tff(c_174, plain, (~searchtree(left('#skF_3'))), inference(splitRight, [status(thm)], [c_54])).
% 3.45/1.85 tff(c_235, plain, (empty='#skF_3' | ~searchtree('#skF_3')), inference(resolution, [status(thm)], [c_232, c_174])).
% 3.45/1.85 tff(c_241, plain, (empty='#skF_3'), inference(demodulation, [status(thm), theory('equality')], [c_52, c_235])).
% 3.45/1.85 tff(c_243, plain, $false, inference(negUnitSimplification, [status(thm)], [c_50, c_241])).
% 3.45/1.85 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
%------------------------------------------------------------------------------